The polynomial-time hierarchy and sparse oracles
Journal of the ACM (JACM)
Relativizing complexity classes with sparse oracles
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New lower bounds for parallel computation
STOC '86 Proceedings of the eighteenth 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
Optimal bounds for decision problems on the CRCW PRAM
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Relativized polynomial time hierarchies having exactly K levels
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
New lower bounds for parallel computation
Journal of the ACM (JACM)
Circuits and local computation
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Separating and collapsing results on the relativized probabilistic polynomial-time hierarchy
Journal of the ACM (JACM)
Functions with bounded symmetric communication complexity and circuits with mod m gates
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The expressive power of voting polynomials
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On deterministic approximation of DNF
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Complexity classes defined by counting quantifiers
Journal of the ACM (JACM)
Learning the Fourier spectrum of probabilistic lists and trees
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth 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
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Characterizing non-deterministic circuit size
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
A weight-size trade-off for circuits with MOD m 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
Pseudorandom generators and learning algorithms for AC
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM SIGACT News
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Journal of the ACM (JACM)
Exponential lower bounds for depth 3 Boolean circuits
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Is there an algebraic proof for P ≠ NC? (extended abstract)
STOC '97 Proceedings of the twenty-ninth 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
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
Computational complexity of neural networks: a survey
Nordic Journal of Computing
A Note on Universal Measures for Weak Implicit Computational Complexity
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Resolution Refutations and Propositional Proofs with Height-Restrictions
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theoretical Computer Science - Australasian computer science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hausdorff dimension and oracle constructions
Theoretical Computer Science
On learning embedded midbit functions
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Error-bounded probabilistic computations between MA and AM
Journal of Computer and System Sciences
Combinatorics, Probability and Computing
SIGACT news complexity theory column 53
ACM SIGACT News
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Generic oracles and oracle classes
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
A uniform lower bound on weights of perceptrons
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exponential lower bound for bounded depth circuits with few threshold gates
Information Processing Letters
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Collapsing recursive oracles for relativized polynomial hierarchies
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The dot-depth and the polynomial hierarchy correspond on the delta levels
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.00 |