Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. A.V. Aho, J.E. Hopcroft and J.D. Ullman /1974/, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading Mass.
2. A.V.Aho and R.Sethi /1977/, How hard is compiler code generation? in: Proc. Fourth Colloquium on Automata Languages and Programming, pp. 1–15, Lecture Notes in Computer Science 52, Springer /1977/.
3. S.Even and R.E.Tarjan, A.Combinatorial problem which is complete in polynomial space.
4. J.E.Hopcroft, W.J.Paul and L.G.Valiant /1975/, On time versus space and related problems, Proc.16 th Annual Symposium on Fundations of Computer Science, pp.57–64.
5. N.D. Jones, Y.E. Lien, W.T. Laaser /1976/, New problem complete for nondeterministic log-space, Mathematical Systems Theory 10:1, 239–259.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献