Linear gaps between degrees for the polynomial calculus modulo distinct primes
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Homogenization and the Polynominal Calculus
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Exponential Lower Bound for Static Semi-algebraic Proofs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
ICALP '02 Proceedings of the 29th 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
Homogenization and the polynomial calculus
Computational Complexity
Hard examples for the bounded depth Frege proof system
Computational Complexity
Constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations
ACM Transactions on Computational Logic (TOCL)
Polynomial-size Frege and resolution proofs of st-connectivity and Hex tautologies
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Phase transition of multivariate polynomial systems
Mathematical Structures in Computer Science
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games
ACM Transactions on Computational Logic (TOCL)
Phase transition of multivariate polynomial systems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Twelve problems in proof complexity
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Entailment multipliers: an algebraic characterization of validity for classical and modal logics
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Algebraic proofs over noncommutative formulas
Information and Computation
Algebraic proofs over noncommutative formulas
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |