Regular resolution lower bounds for the weak Pigeonhole principle

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 347-355

  Pitassi, Toniann ^a   Raz, Ran ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; GRAPH THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; NUMBER THEORY; PROBABILITY; PROBLEM SOLVING; RANDOM PROCESSES;

PIGEONHOLE PRINCIPLE;

COMBINATORIAL MATHEMATICS;

EID: 0034826220     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380821     Document Type: Conference Paper

References (12)

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 relative efficiency of propositional proof systems
6. The intractability of Resolution
7. Provability of the pigeonhole principle and the existence of infinitely many primes
8. Resolution lower bounds for the weak pigeonhole principle
9. Lower bounds for the polynomial calculus
10. Read-once branching programs, rectangular proofs of the pigeonhole principle, and the transversal calculus
11. Hard examples for Resolution