Publisher
Springer Berlin Heidelberg
Reference64 articles.
1. K. Abrahamson: Time-space tradeoffs for algebraic problems on general sequential machines. JCSS 43, 269–289 (1991)
2. K. Abrahamson: A time-space tradeoff for Boolean Matrix multiplication, In Proc. 31st FOCS, 412–419 (1990)
3. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rodl, E. Szemeredi, Gy. Turan: Two lower bounds for branching programs, In Proc. 18th ACM STOC, 30–38, (1986)
4. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovasz, C. Rackoff: Random walks, universal traversal sequences, and the complexity of maze problems. In Proc. 20th Annual Symposium on Foundations of Computer Science, 1979, 218–223
5. N. Alon, W. Maass: Meanders and their applications in lower bounds arguments. JCSS 37, 118–129 (1988)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献