Author:
Iwama Kazuo,Morizumi Hiroki
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. N. Blum. A 2.75n-lower bound on the network complexity of boolean functions. Tech. Rept. A 81/05, Universität des Saarlandes, 1981.
2. N. Blum. A Boolean function requiring 3n network size. Theoret. Comput. Sci., 28, pp. 337–345, 1984.
3. O. Lachish and R. Raz. Explicit lower bound of 4.5n − o(n) for Boolean circuits. Proc. STOC’01, pp. 399–408, 2001.
4. W. Paul. A 2.5n-lower bound on the combinational complexity of boolean functions. SIAM J. Comput. 6, pp. 427–443, 1977.
5. C. Schnorr. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13, pp. 155–171, 1974.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献