Lower bounds for cutting planes proofs with small coefficients
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Semidefinite Programming Relaxations of (2+p)-SAT
Annals of Mathematics and Artificial Intelligence
Relaxations of the Satisfiability Problem Using Semidefinite Programming
Journal of Automated Reasoning
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
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
Exponential Lower Bound for Static Semi-algebraic Proofs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Resolution with Generalized Symmetry Rules
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Proof Complexity of Pigeonhole Principles
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Finite Limits and Monotone Computations: The Lower Bounds Criterion
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points
Annals of Mathematics and Artificial Intelligence
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Resolution Width and Cutting Plane Rank Are Incomparable
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A direct construction of polynomial-size OBDD proof of pigeon hole problem
Information Processing Letters
Note: On the Chvátal rank of the Pigeonhole Principle
Theoretical Computer Science
Implementing a generalized version of resolution
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Cutting Planes and the Parameter Cutwidth
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Lower bounds for lovász-schrijver systems and beyond follow from multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Complexity of semialgebraic proofs with restricted degree of falsity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
A rank lower bound for cutting planes proofs of ramsey's theorem
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Implicit learning of common sense for reasoning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.05 |