Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Depth reduction for circuits of unbounded fan-in
Information and Computation
The power of the middle bit of a #P function
Journal of Computer and System Sciences
Computational Complexity - Special issue on circuit complexity
Lower bounds for cutting planes proofs with small coefficients
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
An exponential lower bound for the size of monotone real circuits
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Short Propositional Refutations for Dense Random 3CNF Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |