The power of the binary value principle
From MaRDI portal
Publication:6057309
DOI10.1007/978-3-031-30448-4_3arXiv2210.17429MaRDI QIDQ6057309
Edward A. Hirsch, Yaroslav Alekseev
Publication date: 4 October 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2210.17429
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic proof systems over formulas.
- Resolution with counting: dag-like lower bounds and different moduli
- Polynomial size proofs of the propositional pigeonhole principle
- The relative efficiency of propositional proof systems
- Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
- Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative?
- A lower bound for polynomial calculus with extension rule
This page was built for publication: The power of the binary value principle
