Resolution and the Weak Pigeonhole Principle

Short proofs are narrow—resolution made simple

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

A new proof of the weak pigeonhole principle

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing

Short proofs are narrow—resolution made simple

Journal of the ACM (JACM)

Regular resolution lower bounds for the weak pigeonhole principle

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Space bounds for resolution

Information and Computation

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

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

Proof Complexity of Pigeonhole Principles

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory

Lower Bounds for Space in Resolution

CSL '99 Proceedings of the 13th International Workshop and 8th 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

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

A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Resolution lower bounds for the weak functional pigeonhole principle

Theoretical Computer Science - Logic and complexity in 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

Optimal Length Resolution Refutations of Difference Constraint Systems

Journal of Automated Reasoning

Width versus size in resolution proofs

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Parameterized Bounded-Depth Frege Is not Optimal

ACM Transactions on Computation Theory (TOCT)

Parameterized Complexity of DPLL Search Procedures

ACM Transactions on Computational Logic (TOCL)