Potential of the approximation method

Developing some techniques for the approximation method, we establish precise versions of the following statements concerning lower bounds for circuits that detect cliques of size s in a graph with m vertices. For 5/spl les/s/spl les/m/4, a monotone circuit computing CLIQUE(m, s) contains at least (1/2) 1.8/sup min(/spl radic/s-1/2,m/(4s))/ gates. If a non-monotone circuit computes CLIQUE using a "small" amount of negation, then the circuit contains an exponential number of gates. The former is proved very simply using so called bottleneck counting argument within the framework of approximation, whereas the latter is verified introducing a notion of restricting negation and generalizing the sunflower contraction.

[1]  Alexander A. Razborov,et al.  On the method of approximations , 1989, STOC '89.

[2]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[3]  Armin Haken,et al.  Counting bottlenecks to show monotone P/spl ne/NP , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[4]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[5]  Katsutoshi Nakayama,et al.  Loop Circuits and Their Relation to Razborov's Approximation Model , 1995, Inf. Comput..

[6]  Mauricio Karchmer,et al.  On proving lower bounds for circuit size , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.