Publisher
Springer Berlin Heidelberg
Reference4 articles.
1. S.A. Cook: Deterministic CFL's are accepted simultaneously in polynomial time and log squared tape, 11th ACM Symposium on Theory of Computing, 1971, 338–345
2. E.M. Gurari, O.H. Ibarra: On the space complexity of recursive algorithm, Inf. Proc. Letters, Vol. 8, No. 5, 1979, 267–272
3. B. Schmidt: Ph.D. Thesis, Universität des Saarlandes, Fachbereich 10, 6600 Saarbrücken, in preparation
4. S. Swami, J. Savage: Space-Time Tradeoffs for linear Recursion, 6th ACM Symposium on Principles of Programming Languages, 1979, 135–142
Cited by
68 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献