Regular resolution lower bounds for the weak pigeonhole principle

Authors:
Toniann Pitassi;Ran Raz
Affiliations:
Department of Computer Science, University of Toronto;Department of Computer Science, Weizmann Institute
Venue:
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Year:
2001

Citing 8
Cited 13

Hard examples for resolution

Journal of the ACM (JACM)
Resolution proofs of generalized pigeonhole principles. (Note)

Theoretical Computer Science
Bounded arithmetic, propositional logic, and complexity theory

Bounded arithmetic, propositional logic, and complexity theory
Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Lower bounds for the polynomial calculus

Computational Complexity
Resolution and the Weak Pigeonhole Principle

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Size space tradeoffs for resolution

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution Proofs of Matching Principles

Annals of Mathematics and Artificial Intelligence
Proof Complexity of Pigeonhole Principles

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution

Information and Computation
A new proof of the weak Pigeonhole principle

Journal of Computer and System Sciences - Special issue on STOC 2000
Resolution lower bounds for the weak functional pigeonhole principle

Theoretical Computer Science - Logic and complexity in computer science
Mutilated chessboard problem is exponentially hard for resolution

Theoretical Computer Science
Resolution lower bounds for the weak pigeonhole principle

Journal of the ACM (JACM)
Resolution lower bounds for perfect matching principles

Journal of Computer and System Sciences - Special issue on computational complexity 2002
Note: The NP-hardness of finding a directed acyclic graph for regular resolution

Theoretical Computer Science
Width versus size in resolution proofs

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that any regular resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length &OHgr;(2^{n^{&egr;}}), (for some global constant &egr; 0$).