Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth 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
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Resolution Refutations and Propositional Proofs with Height-Restrictions
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
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
A new proof of the weak Pigeonhole principle
Journal of Computer and System Sciences - Special issue on STOC 2000
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A note on propositional proof complexity of some Ramsey-type statements
Archive for Mathematical Logic
Exponential lower bounds for AC0-Frege imply superpolynomial frege lower bounds
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the elimination of quantifier-free cuts
Theoretical Computer Science
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Propositional logic for circuit classes
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
The complexity of proving that a graph is ramsey
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hi-index | 0.00 |