Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference29 articles.
1. N. Alon andW. Maass, Meanders and their application in lower bounds arguments.J. Comput. System Sci. 37 (1988), 118?129.
2. A. E. Andreev, On a method giving larger than quadratic effective lower bounds for the complexity of ?-schemes.Vestnik Moscow Univ. Ser. 1 (Math. Mech.) 6, 1986, 73?76. (In Russian.)
3. L. Babai, N. Nisan, andM. Szegedy, Multiparty protocols, pseudorandom generators for Logspace and time-space trade-offs.J. Comput. System Sci. 45 (1992), 204?232.
4. L. Babai, P. Pudlák, V. Rödl, andE. Szemerédi, Lower bounds to the complexity of symmetric Boolean functions.Theoret. Comput. Sci. 74 (1990), 313?323.
5. S. N. Bhatt andF. T. Leighton, A framework for solving VLSI graph layout problems.J. Comput. System Sci. 28(1984), 300?343.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献