Author:
Nishimura Harumichi,Yamakami Tomoyuki
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Lecture Notes in Computer Science;A. Ambainis,2004
2. Babai, L.: Trading group theory for randomness. In: Proc. 17th STOC, pp. 421–429 (1985)
3. Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inform. Control 58, 113–136 (1983)
4. Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31, 1456–1478 (2002)
5. Condon, A.: The complexity of space bounded interactive proof systems. In: Ambos-Spies, et al. (eds.) Complexity Theory: Current Research, pp. 147–189. Cambridge University Press, Cambridge (1993)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献