Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Threshold functions and bounded depth monotone circuits
Journal of Computer and System Sciences
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
The monotone circuit complexity of Boolean functions
Combinatorica
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Exponential lower bounds for restricted monotone circuits
STOC '83 Proceedings of the fifteenth 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
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
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
When do extra majority gates help?
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
Size-depth trade-offs for threshold circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exponential lower bounds for depth 3 Boolean circuits
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
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
Affine projections of symmetric polynomials
Journal of Computer and System Sciences - Complexity 2001
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Computational Power of Boolean Decision Lists
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Hard examples for the bounded depth Frege proof system
Computational Complexity
Relativized collapsing between BPP and PH under stringent oracle access
Information Processing Letters
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
An improved exponential-time algorithm for k-SAT
Journal of the ACM (JACM)
On the computational power of Boolean decision lists
Computational Complexity
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
SIGACT news complexity theory column 53
ACM SIGACT News
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Elusive functions and lower bounds for arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Ehrenfeucht-Fraïssé Games on Random Structures
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Learning Deep Architectures for AI
Foundations and Trends® in Machine Learning
Why Does Unsupervised Pre-training Help Deep Learning?
The Journal of Machine Learning Research
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Distributionally-hard languages
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Typically-correct derandomization
ACM SIGACT News
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Poly-logarithmic independence fools bounded-depth boolean circuits
Communications of the ACM
The Journal of Machine Learning Research
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Pseudo-random graphs and bit probe schemes with one-sided error
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Extractors and lower bounds for locally samplable sources
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Correlation bounds for poly-size AC0 circuits with n1-o(1) symmetric gates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
On the expressive power of deep architectures
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Extractors and Lower Bounds for Locally Samplable Sources
ACM Transactions on Computation Theory (TOCT)
Random access to advice strings and collapsing results
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Protecting circuits from leakage: the computationally-bounded and noisy cases
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
| Hi-index | 0.02 |