Lower bounds for the polynomial calculus and the Gröbner basis algorithm

Exponential Lower Bound for Static Semi-algebraic Proofs

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming

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

A Study of Proof Search Algorithms for Resolution and Polynomial Calculus

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

Algebraic proof systems over formulas

Theoretical Computer Science - Logic and complexity in computer science

Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations

ACM Transactions on Computational Logic (TOCL)

Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

Expressing combinatorial problems by systems of polynomial equations and hilbert's nullstellensatz

Combinatorics, Probability and Computing

Optimality of size-degree tradeoffs for polynomial calculus

ACM Transactions on Computational Logic (TOCL)

Algebraic proofs over noncommutative formulas

Information and Computation

Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz

Journal of Symbolic Computation

On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing

Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Strong ETH holds for regular resolution

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Some trade-off results for polynomial calculus: extended abstract

Proceedings of the forty-fifth 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

Towards an understanding of polynomial calculus: new separations and lower bounds

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I