Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference36 articles.
1. Probabilistic automata;Rabin;Inf. Control,1963
2. Probabilistic automata;Bukharaev;J. Math. Sci.,1980
3. Arthur–Merlin games: a randomized proof system, and a hierarchy of complexity classes;Babai;J. Comput. Syst. Sci.,1988
4. On the complexity of space bounded interactive proofs;Condon,1989
5. Unbounded-error quantum computation with small space bounds;Yakaryilmaz;Inf. Comput.,2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08