Recently, Razborov obtained superpolynomial lower bounds for monotone circuits that cliques in graphs. In particular, Razborov showed that detecting cliques of sizes in a graphm vertices requires monotone circuits of size Ω(ms/(logm)2s) for fixeds, and sizemΩ(logm) form/4].
In this paper we modify the arguments of Razborov to obtain exponential lower bounds for circuits. In particular, detecting cliques of size (1/4) (m/logm)2/3 requires monotone circuits exp (Ω((m/logm)1/3)). For fixeds, any monotone circuit that detects cliques of sizes requiresm)s) AND gates. We show that even a very rough approximation of the maximum clique of a graph requires superpolynomial size monotone circuits, and give lower bounds for some Boolean functions. Our best lower bound for an NP function ofn variables is exp (Ω(n1/4 · (logn)1/2)), improving a recent result of exp (Ω(n1/8-ε)) due to Andreev.
AMS subject classification (1980)
68 E 10 68 C 25
This is a preview of subscription content, log in to check access.
A. V. Aho, J. E. Hopcroft, andJ. D. Ullman,The Design and Analysis of Computer Algorithms, Addison—Wesley, Reading, 1974.zbMATHGoogle Scholar
A. E. Andreev, On a method for obtaining lower bounds for the complexity of individual monotone functions,Dokl. Ak. Nauk. SSSR282 (1985), 1033–1037 (in Russian). English translation inSov. Math. Dokl.31 (1985), 530–534.Google Scholar
P. A. Bloniarz,The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph, Ph. D. Dissertation, Technical Report238, Laboratory for Computer Science, Massachusetts Institute of Technology, 1979.Google Scholar
A. A. Razborov, Lower bounds for the monotone complexity of some Boolean functions,Dokl. Ak. Nauk. SSSR,281, (1985), 798–801 (in Russian). English translation in:Sov. Math. Dokl.,31 (1985), 354–357.MathSciNetGoogle Scholar
A. A. Razborov, Lower bounds on monotone network complexity of the logical permanent,Mat. Zametki,37 (1985), 887–900 (in Russian). English translation in:Math. Notes of the Academy of Sciences of the USSR37 (1985), 485–493.MathSciNetGoogle Scholar
C. E. Shannon, The synthesis of two-terminal switching circuits,Bell System Technical Journal,28 (1949), 59–98.MathSciNetGoogle Scholar