Resolution lower bounds for the weak pigeonhole principle

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 553-562

  Raz, Ran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MAPPING; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

RESOLUTION LOWER BOUNDS; RESOLUTION PROOFS; WEAK PIGEONHOLE PRINCIPLE;

COMPUTATION THEORY;

EID: 0036036844     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509984.509987     Document Type: Conference Paper

References (15)

1. Simplified and improved resolution lower bounds
2. Resolution and the weak pigeonhole principle
3. Short proofs are narrow-resolution made simple
4. Resolution proofs of generalized pigeonhole principles
5. The intractability of resolution
6. Proofs as games
7. Regular resolution lower bounds for the weak pigeonhole principle
8. Bounded arithmetic and lower bounds in Boolean complexity
9. Lower bounds for propositional proofs and independence results in bounded arithmetic
10. Lower bounds for the polynomial calculus
11. Improved resolution lower bounds for the weak pigeonhole principle
12. Resolution lower bounds for the weak functional pigeonhole principle
13. Resolution lower bounds for perfect matching principles
14. Read-once branching programs, rectangular proofs of the pigeonhole principle, and the transversal calculus
15. Hard examples for resolution