Author:
AISENBERG JAMES,BONET MARIA LUISA,BUSS SAM
Abstract
AbstractWe extend results of Bonet, Buss and Pitassi on Bondy’s Theorem and of Nozaki, Arai and Arai on Bollobás’ Theorem by proving that Frankl’s Theorem on the trace of sets has quasipolynomial size Frege proofs. For constant values of the parametert, we prove that Frankl’s Theorem has polynomial size AC0-Frege proofs from instances of the pigeonhole principle.
Publisher
Cambridge University Press (CUP)
Reference16 articles.
1. The provably total NP search problems of weak second order bounded arithmetic
2. Bounded Arithmetic, Propositional Logic and Complexity Theory
3. Classic Papers in Combinatorics
4. [11] Istrate Gabriel and Crãciun Adrian , Proof complexity and the Kneser-Lovász theorem, Theory and Applications of Satisfiability Testing (SAT) , Lecture Notes in Computer Science, vol. 8561, Springer Verlag, 2014, pp. 138–153.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02
2. Bibliography;Proof Complexity;2019-03-28
3. The Nature of Proof Complexity;Proof Complexity;2019-03-28
4. Model Theory and Lower Bounds;Proof Complexity;2019-03-28
5. Hard Tautologies;Proof Complexity;2019-03-28