An exponential lower bound for the bit pigeonhole principle in resolution over parities
cs.CC, cs.LO
Submitted: 2026-09-19
Updated: 2026-11-03
Code: https://github.com/kbr-/math-research
Terminology
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?