Resolution lower bounds for the weak pigeonhole principle

Authors:
Ran Raz
Affiliations:
Weizmann Institute, Rehovot, Israel
Venue:
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Year:
2002

Citing 10
Cited 10

Hard examples for resolution

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

Theoretical Computer Science
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
Regular resolution lower bounds for the weak pigeonhole principle

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Resolution and the Weak Pigeonhole Principle

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Resolution Lower Bounds for Perfect Matching Principles

CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Simplified and improved resolution lower bounds

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

Improved bounds on the weak Pigeonhole principle and infinitely many primes from weaker axioms

Theoretical Computer Science - Mathematical foundations of computer science
Lower bounds for the weak Pigeonhole principle and random formulas beyond resolution

Information and Computation
Optimality of size-width tradeoffs for resolution

Computational Complexity
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
On the complexity of resolution with bounded conjunctions

Theoretical Computer Science
Resolution for Max-SAT

Artificial Intelligence
Width versus size in resolution proofs

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Strong ETH holds for regular resolution

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

(MATH) We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length ω(2n&egr;), (for some constant &egr; ρ 0). One corollary is that a certain propositional formulation of the statement NP \not \subset P/poly does not have short Resolution proofs.