The monotone circuit complexity of Boolean functions
Combinatorica
Many hard examples for resolution
Journal of the ACM (JACM)
Resolution proofs of generalized pigeonhole principles. (Note)
Theoretical Computer Science
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth 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
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Efficiency of Resolution and Davis--Putnam Procedures
SIAM Journal on Computing
Resolution and the Weak Pigeonhole Principle
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
On the automatizability of resolution and related propositional proof systems
Information and Computation
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Lower bounds for k-DNF resolution on random 3-CNFs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Improved lower bounds for tree-like resolution over linear inequalities
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Mean-payoff games and propositional proofs
Information and Computation
On minimal unsatisfiability and time-space trade-offs for k-DNF resolution
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.00 |
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conjunctions. We prove that the weak pigeonhole principle PHPncn and random unsatisfiable CNF formulas require exponential-size proofs in this system. This is the strongest system beyond Resolution for which such lower bounds are known. As a consequence to the result about the weak pigeonhole principle, Res(log) is exponentially more powerful than Res(2). Also we prove that Resolution cannot polynomially simulate Res(2) and that Res(2) does not have feasible monotone interpolation solving an open problem posed by Krajícek.