The monotone circuit complexity of Boolean functions
Combinatorica
On the complexity of cutting-plane proofs
Discrete Applied Mathematics
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for matching require linear depth
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Randomized versus nondeterministic communication complexity
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cuting Plane Versus Frege Proof Systems
CSL '90 Proceedings of the 4th Workshop on Computer Science Logic
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Finite Limits and Monotone Computations: The Lower Bounds Criterion
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
On the automatizability of resolution and related propositional proof systems
Information and Computation
Mean-payoff games and propositional proofs
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the rank of cutting-plane proof systems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
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
| Hi-index | 0.00 |