Author:
Ďuriš Pavol,Hromkovič Juraj,Jukna Stasys,Sauerhoff Martin,Schnitger Georg
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. M. Ajtai, A non-linear time lower bound for Boolean branching programs, Proc. of 40th FOCS, 1999, pp. 60–70.
2. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlák, V. Rödl, E. Szemeredi, and Gy. Turán, Two lower bounds for branching programs, in: Proc. 18th ACM STOC, 1986, pp. 30–38.
3. P. Beame, M. Saks, X. Sun, and E. Vee, Super-linear time-space tradeoff lower bounds for randomized computation, Technical Report 25, Electr. Coll. on Comp. Compl., 2000.
4. P. Beame, M. Saks, and J. S. Thathachar, Time-space tradeoffs for branching programs, in: Proc. of 39th FOCS, 1998, pp. 254–263.
5. A. Borodin, A. Razborov, and R. Smolensky, On lower bounds for read-k-times branching programs, Computational Complexity 3 (1993), pp. 1–18.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献