Author:
Iwama Kazuo,Morizumi Hiroki,Tarui Jun
Subject
General Computer Science,Theoretical Computer Science
Reference24 articles.
1. M. Ajtai, J. Komlós, E. Szemerédi, An O(nlogn) sorting network, in: Proc. of 15th STOC, 1983, pp. 1–9
2. A superpolynomial lower bound for a circuit computing the clique function with at most (1/6)loglogn negation gates;Amano;SIAM J. Comput.,2005
3. On the negation-limited circuit complexity of merging;Amano;Discrete Appl. Math.,2003
4. On a method for obtaining lower bounds for the complexity of individual monotone functions;Andreev;Sov. Math. Doklady,1985
5. On the complexity of negation-limited boolean networks;Beals;SIAM J. Comput.,1998
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献