Lower Bounds for Constant Depth Circuits for Prefix Problems
Proceedings of the 10th Colloquium on Automata, Languages and Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Lower bounds on communication complexity
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Threshold functions and bounded deptii monotone circuits
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth 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
On notions of information transfer in VLSI circuits
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
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Circuits and local computation
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Rounds in communication complexity revisited
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
On data structures and asymmetric communication complexity
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Finite Limits and Monotone Computations: The Lower Bounds Criterion
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
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
The complexity of depth-3 circuits computing symmetric Boolean functions
Information Processing Letters
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
| Hi-index | 0.00 |
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone formulae with restricted depth. Specifically, we show that there are functions with &pgr;k-formula of size n for which every &sgr;k-formula has size exp &ohgr;(n1/(k−1)). A similar lower bound applies to concrete functions such as transitive closure and clique. We also show that any function with a formula of size n (and any depth) has a &sgr;k-formula of size exp o(n1/(k−1)). Thus our hierarchy theorem is the best possible.