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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 399-408

  Amano, Kazuyuki ^a   Maruoka, Akira ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

TIMING CIRCUITS; ARTIFICIAL INTELLIGENCE; COMPUTERS;

APPROXIMATION METHODS; BOOLEAN CIRCUIT; CLIQUE FUNCTION; CONSTANT-DEPTH CIRCUITS; MONOTONE CIRCUIT; MONOTONE FUNCTIONS; NEGATION-LIMITED CIRCUIT; NEW APPROACHES;

BOOLEAN FUNCTIONS;

EID: 84896693306     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055789     Document Type: Conference Paper

References (8)

1. N. Alon and R. B. Boppana, "The Monotone Circuit Complexity of Boolean Functions,", Combinatorial, Vol. 7, No. 1, pp. 1-22, 1987.
2. K. Amano and A. Maruoka, "Potential of the Approximation Method,", Proc, 37th FOCS, pp. 431-440, 1996.
3. R. Beals, T. Nishino and K. Tanaka, "More on the Complexity of Negation-Limited Circuits,", Proc. 27th STOC, pp. 585-595, 1995.
4. M.J. Fischer, "The Complexity of Negation-Limited Networks-a Brief Survey,", Lecture Notes in Computer Science 33, Springer-Verlag, Berlin, pp. 71-82, 1974.
5. J. Hastad, "Almost Optimal Lower Bounds for Small Depth Circuits,", Proc. 18th STOC, pp. 6-20, 1986.
6. A.A. Razborov, "Lower Bounds on the Monotone Complexity of Some Boolean Functions,", Soviet Math. Dokl, Vol. 281, pp. 798-801, 1985.
7. A.A. Razborov, "On the Method of Approximations,", Proc. 21st STOC, pp. 167-176, 1989.
8. M. Santha and C. Wilson, "Limiting Negations in Constant Depth Circuits,", SIAM J. Cormput., Vol. 22, No. 2, pp. 294-302, 1993.