The Complexity of Choosing Parity Projections
cs.CC
Submitted: 2026-10-30
Updated: 2026-10-30
Code: https://github.com/openai/math
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
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?