Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Alvarez,C., and Jenner,B., A Very Hard LOG Space Counting Class, Proceedings 5th Annual Conference on Structure in Complexity Theory, (1990),154–168.
2. Chandra, A.K., Kozen, D.C. and Stockmeyer, L., Alternation, JACM 28 (1981), 114–133.
3. Cook, S.A. Characterizations of pushdown machines in terms of time-bounded computers, JACM 18(1971), 4–18
4. Ibarra, O.H., Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata, JCSS 5(1971), 88–117.
5. Jenner,B.,personal communication.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Logspace verifiers, NC, and NP;Algorithms and Computations;1995