Author:
Ambainis Andris,Freivalds Rūsiņš,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. A.Ambainis, The complexity of probabilistic versus deterministic finite automata. Lecture Notes in Computer Science, 1178(1996).
2. C. Dwork, L. Stockmeyer, Finite state verifiers I: The power of interaction. Journal of ACM, 39, 4 (1992), 800–828.
3. R. Freivalds, Probabilistic machines can use less running time. Information Processing'77, IFIP, North-Holland, 1977, 839–842.
4. R. Freivalds, Fast probabilistic algorithms. Lecture Notes in Computer Science, 74 (1979), 57–69.
5. R. Freivalds, Probabilistic two-way machines. Lecture Notes in Computer Science, 118(1981), 33–45.