Author:
Say A. C. Cem,Yakaryılmaz Abuzer
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Condon, A.: Computational Models of Games. MIT Press (1989)
2. Condon, A.: Space-bounded probabilistic game automata. Journal of the ACM 38(2), 472–494 (1991)
3. Condon, A.: The complexity of the max word problem and the power of one-way interactive proof systems. Computational Complexity 3(3), 292–305 (1993)
4. Condon, A.: The complexity of space bounded interactive proof systems. In: Complexity Theory: Current Research, pp. 147–190. Cambridge University Press (1993)
5. Condon, A., Ladner, R.: Interactive proof systems with polynomially bounded strategies. Journal of Computer and System Sciences 50(3), 506–518 (1995)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献