Author:
Morizumi Hiroki,Tarui Jun
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. M. Ajtai, J. Komlós, E. Szemerédi, An O(nlogn) sorting network, in: Proceedings of STOC83: The 15th Annual ACM Symposium on Theory of Computing, 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 Journal on Computing,2005
3. On the negation-limited circuit complexity of merging;Amano;Discrete Applied Mathematics,2003
4. On the complexity of negation-limited Boolean networks;Beals;SIAM Journal on Computing,1998
5. The complexity of finite functions;Boppana,1990
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Negation-Limited Inverters of Linear Size;IEICE Transactions on Information and Systems;2010