On the negation-limited circuit complexity of merging

Discrete Applied Mathematics

Volumn 126, Issue 1, 2003, Pages 3-8

  Amano, Kazuyuki ^a   Maruoka, Akira ^a   Tarui, Jun ^b  

^a TOHOKU UNIVERSITY   (Japan)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867999661     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00215-9     Document Type: Conference Paper

References (12)

1. M. Ajtai, J. Komlos, and E. Szmeredi An O (n log n) sorting network Combinatorica 3 1 1983 1 19
2. N. Alon, and R.B. Boppana The monotone circuit complexity of boolean functions Combinatorica 7 1 1987 1 22
3. K. Amano, A. Maruoka, A superpolynomial lower bound for a circuit computing the clique function with (1/6) log log n negation gates, Proceedings of the 23rd MFCS, Lecture Notes in Computer Science, Vol. 1450, Springer, Berlin, 1998, pp. 399-408.
4. A.E. Andreev On a method for obtaining lower bounds for the complexity of individual monotone functions Soviet Math. Dokl. 31 3 1985 530 534
5. R. Beals, T. Nishino, and K. Tanaka On the complexity of negation-limited Boolean networks SIAM J. Comput. 27 5 1998 1334 1347
6. S.J. Berkowitz, On some relationships between monotone and non-monotone circuit complexity, Technical Report, University of Toronto, 1982.
7. R.B. Boppana, M. Sipser, The complexity of finite functions, Handbook of Theoretical Computer Science, Elsevier Science, Amsterdam, 1990, pp. 757-804.
8. M.J. Fischer, The complexity of negation-limited networks - a brief survey, Lecture Notes in Computer Science, Vol. 33, Springer, Berlin, 1974, pp. 71-82.
9. D.E. Knuth, The art of computer programming, Sorting and Searching, 2nd Edition, Vol. 3, Addison-Wesley, Reading, MA, 1998.
10. A.A. Markov On the inversion complexity of a system of functions J. ACM 5 1958 331 334
11. A.A. Razborov, On the method of approximations, Proceedings of the 21st STOC, 1989, pp. 167-176.
12. E. Tardos The gap between monotone and non-monotone circuit complexity is exponential Combinatorica 7 4 1987 141 142