Exhaustive Search Is Hard to Beat in Constant Depth for Hyperclique and Orthogonal Vectors
cs.CC
Submitted: 2026-11-04
Updated: 2026-11-04
Terminology
Sources
- 3SUM Made Simpler (Without Matrix Multiplication), k-SUM Hypothesis Refuted for Odd k, and Real 3SUM/APSP Derandomized
- Learning $\mathsf{AC}^0$ under Locally Sampleable Graphical Models
- Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique
- Faster #PPM from faster #3SAT
- Lowered crossover points of Anthropic's subexponential 3-SAT algorithm
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?