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
The monotone circuit complexity of Boolean functions
Combinatorica
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Characterizing non-deterministic circuit size
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A characterization of span program size and improved lower bounds for monotone span programs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Higher lower bounds on monotone size
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Note on the Bottleneck Counting Argument
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Finite Limits and Monotone Computations: The Lower Bounds Criterion
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
The status of the P versus NP problem
Communications of the ACM - The Status of the P versus NP Problem
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Symmetric functions capture general functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the monotone circuit complexity of quadratic boolean functions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |