Some Exact Complexity Results for Straight-Line Computations over Semirings
Journal of the ACM (JACM)
The Complexity of Computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh 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
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
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
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Utilizing moment invariants and Grobner bases to reason about shapes
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Arithmetic circuits: The chasm at depth four gets wider
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we consider monotone Boolean circuits with three alternations, in the order “or”, “and”, “or.” Whenever the number of alternations is limited to a fixed constant the formula and circuit size measures are polynomially related to each other. We shall therefore refer to this measure interchangeably as &Sgr;&pgr;&Sgr;-formula size or &Sgr;&pgr;&Sgr;-circuit size. We shall prove that any such circuit or formula for detecting the existence of cliques in an N-node graph has at least 2&Ohgr;(N&egr;) gates for some &egr; 0 independent of N.