Affiliation:
1. KTH Royal Institute of Technology, Sweden
Abstract
We prove that a small-depth Frege refutation of the Tseitin contradiction on the grid requires subexponential size. We conclude that polynomial size Frege refutations of the Tseitin contradiction must use formulas of almost logarithmic depth.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On small-depth Frege proofs for PHP;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps;Journal of the ACM;2023-07-20
3. On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
4. Tradeoffs for small-depth Frege proofs;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Improved Pseudorandom Generators from Peudorandom Multi-switching Lemmas;Theory of Computing;2022