Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Ambainis, A., Watrous, J.: Two–way finite automata with quantum and classical states. Theoretical Computer Science 287(1), 299–311 (2002)
2. Lecture Notes in Computer Science;M. Chrobak,1984
3. Condon, A.: Complexity Theory: Current Research, chap. The complexity of space bounded interactive proof systems, pp. 147–190. Cambridge University Press (1993)
4. Condon, A., Lipton, R.J.: On the complexity of space bounded interactive proofs (extended abstract). In: FOCS 1989: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pp. 462–467 (1989)
5. Ďuriš, P., Galil, Z.: Fooling a two-way automaton or one pushdown store is better than one counter for two way machines (preliminary version). In: STOC 1981: Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pp. 177–188 (1981)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献