# Exponential lower bounds for restricted monotone circuits

@article{Valiant1983ExponentialLB,
title={Exponential lower bounds for restricted monotone circuits},
author={Leslie G. Valiant},
journal={Proceedings of the fifteenth annual ACM symposium on Theory of computing},
year={1983}
}
• L. Valiant
• Published 1983
• Computer Science, Mathematics
• Proceedings of the fifteenth annual ACM symposium on Theory of computing
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 ΣπΣ-formula size or ΣπΣ-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Ω(Nε) gates for some ε > 0… Expand

#### Topics from this paper

Threshold Functions and Bounded Depth Monotone Circuits
• R. Boppana
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 1986
It is proved that computing majority on depth d monotone circuits requires exp Ω(n 1 (d−1 ) ) size, which implies exponential lower bounds for other functions, such as testing connectivity and detecting cliques in graphs. Expand
Threshold functions and bounded deptii monotone circuits
• R. Boppana
• Mathematics, Computer Science
• STOC '84
• 1984
An exponential lower bound for the majority function on constant depth monotone circuits is proved, solving an open problem of A. Yao's problem and getting exponential lower bounds for other problems, such as connectivity and cliques. Expand
Lower bounds on monotone arithmetic circuits with restricted depths
Abstract We consider monotone arithmetic circuits with restricted depths to compute monotone multivariate polynomials such as the elementary symmetric functions, convolution of several vectors andExpand
Almost optimal lower bounds for small depth circuits
• Computer Science, Mathematics
• STOC '86
• 1986
Improved lower bounds for the size of small depth circuits computing several functions are given and it is shown that there are functions computable in polynomial size and depth k but requires exponential size when the depth is restricted to k 1. Expand
On the Complexity of Slice Functions
It is shown in this paper that monotone circuits for slice functions can be understood as special circuits called set circuits, here disjunction and conjunction are replaced by set union and set intersection. Expand
On the Complexity of Slice Functions
• I. Wegener
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1985
It is shown in this paper that monotone circuits for slice functions can be understood as special circuits called set circuits, here, disjunction and conjunction are replaced by set union and set intersection. Expand
Lower Bounds for Unrestricted Boolean Circuits: Open Problems
To prove that $$\text {P} \ne \text {NP}$$, it suffices to prove a superpolynomial lower bound on Boolean circuit complexity of a function from NP. Currently, we are not even close to achieving thisExpand
Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version)
• A. Yao
• Mathematics, Computer Science
• FOCS
• 1985
We present exponential lower bounds on the size of depth-k Boolean circuits for computing certain functions. These results imply that there exists an oracle set A such that, relative to A, all theExpand
On monotone formulae with restricted depth
• Mathematics, Computer Science
• STOC '84
• 1984
It is shown that any function with a formula of size n (and any depth) has a &sgr;<subscrpt; k-formula of size exp o(n<supscrpt>1/(k−1)</supsCrpt) and the hierarchy theorem is the best possible. Expand
On the Complexity of Branching Programs and Decision Trees for Clique Functions
• I. Wegener
• Mathematics, Computer Science
• TAPSOFT, Vol.1
• 1987
This work introduces the hierarchy of the classes BPk (P) of all sequences of Boolean functions which may be computed by k-times-only branching programs of polynomial size and proves exponentiallower bounds on the decision tree complexity of clique functions. Expand

#### References

SHOWING 1-10 OF 16 REFERENCES
Boolean Functions Whose Monotone Complexity is of Size n2/log n
• I. Wegener
• Mathematics, Computer Science
• Theoretical Computer Science
• 1981
A sequence of monotone Boolean functions hn:{0, 1}n→{0,1}n, such that the monotones complexity of hn is of order n2/log n is constructed, which includes the largest known lower bound of this kind. Expand
A Lower Bound on the Number of Additions in Monotone Computations
• C. Schnorr
• Mathematics, Computer Science
• Theor. Comput. Sci.
• 1976
A general lower bound on the minimal number of additions in monotone, rational computations is proved, which implies that anymonotone rational computation of the n th degree convolution at least requires n 2 − 2 n + 1 additions. Expand
Combinational Complexity of Some Monotone Functions
• Mathematics, Computer Science
• SWAT
• 1974
This paper develops techniques for proving functions of n inputs and 0( n) outputs have nonlinear combinational complexity if only OR and AND operations are allowed, and demonstrates that binary sorting requires 0(n log n) operations. Expand
Parity, circuits, and the polynomial-time hierarchy
• Mathematics, Computer Science
• 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
• 1981
A super-polynomial lower bound is given for the size of circuits of fixed depth computing the parity function and connections are given to the theory of programmable logic arrays and to the relativization of the polynomial-time hierarchy. Expand
Complexity of Monotone Networks for Boolean Matrix Product
• M. Paterson
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1975
Any computation of Boolean matrix product by an acyclic network using only the operations of binary conjunction and disjunction requires at least IJK conjunctions and IJ(K-1) disjunctions for the Expand
Graph-Theoretic Arguments in Low-Level Complexity
One approach to understanding complexity issues for certain easily computable natural functions is surveyed, and the notion of rigidity does offer for the first time a reduction of relevant computational questions to noncomputional properties. Expand
A complexity theory based on Boolean algebra
• Mathematics, Computer Science
• 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
• 1981
It is shown that much of what is of everyday relevance in Turing-machine-based complexity theory can be replicated easily and naturally in this elementary framework. Expand
Some Exact Complexity Results for Straight-Line Computations over Semirings
• Mathematics, Computer Science
• JACM
• 1982
The problem of computing polynomials in certain semmngs is considered and it is shown that the use of branching can exponentially speed up computations using the min, + operations, and that subtraction can exponentiallySpeed up arithmetic computations. Expand
Negation can be exponentially powerful
A positive answer to a problem for which an exponential speedup can be attained using {+,−,×} rather than just {+,×} as operations is given, which is the multivariate polynomial associated with perfect matchings in planar graphs. Expand
Completeness classes in algebra
The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects (A) and (B). Expand