Journal of the ACM (JACM)
Introduction to VLSI Systems
A 2.5 n-lower bound on the combinational complexity of Boolean functions
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Bounds for width two branching programs
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
Languages which capture complexity classes
STOC '83 Proceedings of the fifteenth 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
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
Journal of the ACM (JACM)
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
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)
Circuits and local computation
STOC '89 Proceedings of the twenty-first 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
Analytic sets in descriptive set theory and NP sets in complexity theory
Fundamenta Informaticae
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
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
The First-Order Isomorphism Theorem
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
The Consistency Dimension, Compactness, and Query Learning
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Lower Bound For Perceptrons And An Oracle Separation Of The PP/sup PH/ Hierarchy
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Threshold functions and bounded deptii monotone circuits
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The complexity of approximate counting
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Algorithms and theory of computation handbook
Other complexity classes and measures
Algorithms and theory of computation handbook
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hierarchies of DLOGTIME-uniform circuits
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Regular languages, unambiguous concatenation and computational complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The expressive power of analog recurrent neural networks on infinite input streams
Theoretical Computer Science
On black-box reductions between predicate encryption schemes
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Analytic sets in Descriptive Set Theory and NP sets in Complexity Theory
Fundamenta Informaticae
Inverting onto functions and polynomial hierarchy
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |
It is shown that for every k, polynomial-size, depth-k Boolean circuits are more powerful than polynomial-size, depth-(k−1) Boolean circuits. Connections with a problem about Borel sets and other questions are discussed.