Subject
General Computer Science,Theoretical Computer Science
Reference14 articles.
1. The Design and Analysis of Computer Algorithms;Aho,1972
2. M. Ajtai, A non-linear time lower bound for Boolean branching programs, in: Proc. of 40th IEEE Ann. Symp. on Foundations of Computer Science, 1999, pp. 60–70.
3. P. Beame, M. Saks, X. Sun, E. Vee, Super-linear time-space tradeoff lower bounds for randomized computation, in: Proc. of 41st IEEE Ann. Symp. on Foundations of Computer Science, 2000, pp. 169–179.
4. P.W. Beame, M. Saks, J.S. Thathachar, Time-space trade-offs for branching programs, in: Proc. of 39th IEEE Ann. Symp. on Foundations of Computer Science, 1998, pp. 254–263.
5. A note on read-k-times branching programs;Jukna;RAIRO Theor. Inform. Appl.,1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献