TFNP in the Random Oracle Model
cs.CC
Submitted: 2026-11-03
Updated: 2026-11-03
Project page: https://pritishkamath.github.io/files/phd-thesis.pdf
Terminology
Sources
- The Complexity of Gradient Descent: CLS = PPAD $\cap$ PLS
- Further Collapses in TFNP
- Separations in Proof Complexity and TFNP
- Randomized separations in black-box TFNP
- Verifiable Quantum Advantage without Structure
Related papers
- The Proof Analysis Problem for Constant-Depth Frege
- Hardness of Counting Orderings: Taking Gadget Amplification to the Limit
- Rigorous Low-Degree Implications for Planted Subgraph Detection: Noise and Treewidth
- Parameterized Hardness of Zonotope Containment and Neural Network Verification
- From Block Orthogonality to Decidability in Complex-Weighted Counting CSP
- Random Clocks on Computation Paths: How Far Can They Reach, and When Does Stepping Back Help?