arXiv (All)
open access
An exponential lower bound for the bit pigeonhole principle in resolution over parities
Resolution over parities, $\mathrm{Res}(\oplus)$, is the characteristic-two version of resolution over linear equations: clauses are disjunctions of affine equations over $\mathbb F_2$. Superpolynomial size lower bounds were previously known only for restricted refutations: tree-like, regular, or of
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- 5 U.S.C. § 910 — Introduction and reference of resolution#556526
- 50 U.S.C. § 1547 — Interpretation of joint resolution#599759
- The Declaration Boundary: Forceable Form, Irreducible Content, and the Recursive Limit of Bounded Judgment#693326
- Algebra of Theoretical Term Reductions in the Sciences#742015
- When Equivalence Obscures: On Mathematical Reduction, Epistemic Access, and Expository Machines The Jensen–Laguerre route to the Riemann Hypothesis as a case study#91153
Record · ID 1048410
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive