The potential of the approximation method

SIAM Journal on Computing

Volumn 33, Issue 2, 2004, Pages 433-447

  Amano, Kazuyuki ^a   Maruoka, Akira ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

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

Indexed keywords

COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK ANALYSIS; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CIRCUIT COMPLEXITY; LOWER BOUNDS; MONOTONE CIRCUITS;

APPROXIMATION THEORY;

EID: 2342632544     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753970138445X     Document Type: Article

References (14)

1. N. ALON AND R. B. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica, 7 (1987), pp. 1-22.
2. A. ANDREEV, On a method for obtaining lower bounds for the complexity of individual monotone functions, Soviet Math. Doklady, 31 (1985), pp. 530-534.
3. C. BERG AND S. ULFBERG, Symmetric approximation arguments for monotone lower bounds without sunflowers, Comput. Complexity, 8 (1999), pp. 1-20.
4. A. HAKEN, Counting bottlenecks to show monotone P ≠ NP, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, pp. 36-40.
5. D. HARNIK AND R. RAZ, Higher lower bounds on monotone size, in Proceedings of the 32nd Annual Symposium on Theory of Computing, Portland, OR, 2000, pp. 378-387.
6. 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.
7. M. KARCHMER, On proving lower bounds for circuit size, in Proceedings of the 8th Structure in Complexity Theory, San Diego, CA, IEEE Computer Science Press, Los Alamos, CA, 1993, pp. 112-118. Also in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhaüser Boston, Boston, MA, 1995, pp. 245-255.
8. M. KARCHMER, On proving lower bounds for circuit size, in Proceedings of the 8th Structure in Complexity Theory, San Diego, CA, IEEE Computer Science Press, Los Alamos, CA, 1993, pp. 112-118. Also in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhaüser Boston, Boston, MA, 1995, pp. 245-255.
9. K. NAKAYAMA AND A. MARUOKA, Loop circuits and their relation to Razborov's approximation model, Inform, and Comput., 119 (1995), pp. 154-159.
10. A. A. RAZBOROV, Lower bounds on the monotone complexity of some boolean functions, Soviet Math. Doklady, 31 (1985), pp. 354-357.
11. A. A. RAZBOROV, On the method of approximations, in Proceedings of the 21st Annual Symposium on Theory of Computing, Seattle, WA, 1989, pp. 167-176.
12. A. A. RAZBOROV AND S. RUDICH, Natural proofs, J. Comput. System Sci., 55 (1997), pp. 24-35.
13. J. SIMON AND S. C. TSAI, On the bottleneck counting argument, Theoret. Comput. Sci., 237 (2000), pp. 429-437.
14. A. WIGDERSON, The fusion method for lower bounds in circuit complexity, in Paul Erdo′s Is Eighty, Vol. 1, Keszthely, Hungary, Boklai Soc. Math. Stud., 1993, pp. 453-468.