Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
NP is as easy as detecting unique solutions
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Relativized counting classes: relations among thresholds, parity, and mods
Journal of Computer and System Sciences
PP is closed under intersection
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
When do extra majority gates help?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the degree of Boolean functions as real polynomials
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On the Computational Power of Boolean Decision Lists
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
An Exact Characterization of Symmetric Functions in qAC0[2]
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Journal of Computer and System Sciences - STOC 2001
On the computational power of Boolean decision lists
Computational Complexity
Powering requires threshold depth 3
Information Processing Letters
Separating AC0 from depth-2 majority circuits
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandom generators for polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
Improved lower bounds for learning intersections of halfspaces
COLT'06 Proceedings of the 19th annual conference on Learning Theory
| Hi-index | 0.00 |