Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. Aho, A.V. — Ullman, J.D. — Yanakakis, M.: On notions of information transfer in VLSI circuits. In: Proc. 15th ACM STOC, ACM 1983, 133–139.
2. Alon, N.: Eigenvalues and expanders. Combinatorica 6, 1986, 85–95.
3. Blum, N.: A Boolean function requiring 3n network size. Theoretical Computer Science 28, 1984, 337–345.
4. Harper, L.H. — Savage, J.E.: Complexity made Simple. In: Proc. of the Intern. Symp. on Combinatorial Theory, Rome, Sept. 1973, 2–15.
5. Harper, L.H. — Hsieh, W.N. — Savage, J.E.: A class of Boolean functions with linear combinational complexity. Theoretical Computer Science, Vol. 1, No. 2, 1975, 161–183.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献