Hard examples for bounded depth frege

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 563-572

  Ben Sasson, Eli ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATION THEORY; POLYNOMIALS; THEOREM PROVING;

BOUNDED DEPTH FREGE; FREGE PROOF; PIGEONHOLE PRINCIPLE; TSEITIN GRAPH BASED CONTRADICTION;

COMPUTATIONAL COMPLEXITY;

EID: 0036040279     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509988     Document Type: Conference Paper

References (23)

1. The complexity of the pigeonhole principle
2. Lower bounds for the polynomial calculus: Non-binomial case
3. The probabilistic method
4. A separator theorem for graphs with an excluded minor and its applications
5. An exponential separation between the matching principle and the pigeonhole principle
6. Random CNF's are hard for the polynomial calculus
7. Approximation and small-depth Frege proofs
8. Short proofs are narrow - Resolution made simple
9. Linear gaps between degrees for the polynomial calculus modulo distinct primes
10. Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
11. The complexity of theorem-proving procedures
12. The relative efficiency of propositional proof systems
13. Many hard examples for resolution
14. Tseitin's tautologies and lower bounds for nullstellensatz proofs
15. The intractibility of resolution
16. Almost optimal lower bounds for small depth circuits
17. Exponential lower bounds for the pigeonhole principle
18. Exponential lower bounds to the size of bounded depth frege proofs of the pigeonhole principle
19. Simplified lower bounds for propositional proofs
20. A separator theorem for planar graphs
21. On the complexity of derivation in propositional calculus
22. Hard examples for resolution
23. The complexity of propositional proofs