Subject
General Computer Science,Theoretical Computer Science
Reference10 articles.
1. Lectures on network complexity;Fischer,1974
2. A 2.5 n lower bound on the combinatorial complexity of Boolean functions;Paul;Siam. J. Comput.,1977
3. Fast simulation of combinatorial logic networks by machines without random-access storage;Pippenger,1977
4. The Complexity of Computing;Savage,1976
5. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen;Schnorr;Computing,1974
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献