A superpolynomial lower bound for a circuit computing the clique function with at most (1/6) log log N negation gates

SIAM Journal on Computing

Volumn 35, Issue 1, 2006, Pages 201-216

  Amano, Kazuyuki ^a   Maruoka, Akira ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Approximation method; Circuit complexity; Clique function; Lower bound; Monotone circuit; Negation limited circuit

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTEGRATED CIRCUITS; PROBLEM SOLVING;

APPROXIMATION METHOD; CIRCUIT COMPLEXITY; CLIQUE FUNCTION; LOWER BOUND; MONOTONE CIRCUIT; NEGATION-LIMITED CIRCUIT;

POLYNOMIAL APPROXIMATION;

EID: 33644602160     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701396959     Document Type: Article

References (15)

1. N. ALON AND R. B. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica, 7 (1987), pp, 1-22.
2. K. AMANO AND A. MARUOKA, The potential of the approximation method, SIAM J. Comput., 33 (2004), pp. 433-447.
3. (A preliminary version was in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 431-440.)
4. K. AMANO, A. MARUOKA, AND J. TARUI, On the negation-limited circuit complexity of merging, Discrete Appl. Math., 126 (2003), pp. 3-8.
5. R. BEALS, T. NISHINO, AND K. TANAKA, More on the complexity of negation-limited circuits, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, Las Vegas, NV, 1995, pp. 585-595.
6. C. BERG AND S. ULFBERG, Symmetric approximation arguments for monotone lower bounds without sunflowers, Comput. Complexity, 8 (1999) pp. 1-20.
7. M. J. FISCHER, The complexity of negation-limited networks-A brief survey, Lect. Notes Comput. Sci. 33, Springer-Verlag, Berlin, 1975, pp. 71-82.
8. J. HÅSTAD, Almost optimal lower bounds for small depth circuits, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing, Berkeley, CA, 1986, pp. 6-20.
9. D. HARNIK AND R. RAZ, Higher lower bounds on monotone size, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 378-387.
10. S. JUKNA, Finite limits and monotone computations: The lower bounds criterion, in Proceedings of the 12th IEEE Conference on Computational Complexity, Ulm, Germany, 1997, pp. 302-313.
11. A. A. RAZBOROV, Lower bounds on the monotone complexity of some Boolean functions, Dokl. Akad. Nauk SSSR, 28 (1985), pp. 798-801.
12. A. A. RAZBOROV, On the method of approximations, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, 1989, pp. 167-176.
13. A. A. RAZBOROV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
14. J. SIMON AND S. C. TSAI, On the bottleneck counting argument, Theoret. Comput. Sci., 237 (2000), pp. 429-437.
15. M. SANTHA AND C. WILSON, Limiting negations in constant depth circuits, SIAM J. Comput., 22 (1993) pp. 294-302.