Structural complexity 1
Counting classes: thresholds, parity, mods, and fewness
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
The expressive power of voting polynomials
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounded queries to SAT and the Boolean hierarchy
Theoretical Computer Science
PP is Closed Under Truth-Table Reductions
PP is Closed Under Truth-Table Reductions
On some central problems in computational complexity.
On some central problems in computational complexity.
Structural properties of complexity classes (immunity, core)
Structural properties of complexity classes (immunity, core)
When do extra majority gates help?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Gap-definable counting classes
Journal of Computer and System Sciences
A Generalized Quantifier Concept in Computational Complexity Theory
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
Improved lower bounds for learning intersections of halfspaces
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Bounds on the power of constant-depth quantum circuits
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |