A new proof of the weak pigeonhole principle

Authors:
Alexis Maciel;Toniann Pitassi;Alan R. Woods
Affiliations:
Department of Mathematics and Computer Science, Clarkson University, Potsdam, NY;Department of Computer Science, University of Arizona, Tucson, AZ;Department of Mathematics and Statistics, University of Western, Australia, Nedlands, WA 6907, Australia
Venue:
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Year:
2000

Resolution proofs of generalized pigeonhole principles. (Note)

Theoretical Computer Science
Lower bounds to the size of constant-depth propositional proofs

Journal of Symbolic Logic
Exponential lower bounds for the pigeonhole principle

Computational Complexity
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
An exponential lower bound to the size of bounded depth Frege proofs of the Pigeonhole Principle

Random Structures & Algorithms
Natural proofs

Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Resolution and the Weak Pigeonhole Principle

CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic

Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Complexity of Resolution with Bounded Conjunctions

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
On the Automatizability of Resolution and Related Propositional Proof Systems

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Monotone Proofs of the Pigeon Hole Principle

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
On the complexity of resolution with bounded conjunctions

Theoretical Computer Science

Hi-index	0.00