Affiliation:
1. Graduate School of Information Sciences, Tohoku University
2. School of Engineering, Tohoku University
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software
Reference24 articles.
1. [1] M. Ajtai, J. Komlós, and E. Szemerédi, “An O(nlog n) sorting network,” Proc. 15th STOC, pp.1-9, 1983.
2. [2] N. Alon and R.B. Boppana, “The monotone circuit complexity of Boolean functions,” Combinatorica, vol.7, no.1, pp.1-22, 1987.
3. A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates
4. [4] K. Amano, A. Maruoka, and J. Tarui, “On the negation-limited circuit complexity of merging,” Discrete Appl. Math., vol.126, no.1, pp.3-8, 2003.
5. [5] A.E. Andreev, “On a method for obtaining lower bounds for the complexity of individual monotone functions,” Sov. Math. Doklady, vol.31, no.3, pp.530-534, 1985.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献