The Polynomial-Time Low-Degree Conjecture is False
cs.CC, cs.DS
Submitted: 2026-07-22
Updated: 2026-10-28
Comments: 20 pages. Improved results and presentation
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR
- The Algorithmic Phase Transition in Correlated Spiked Models
- Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic
- Computational Complexity of Statistics: New Insights from Low-Degree Polynomials
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?