Probabilistic two-way machines-Reference-Cited by-同舟云学术

Probabilistic two-way machines

Published:1981 Issue: Volume: Page:33-45
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Freivalds Rūsiņš

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-10856-4_72.pdf

Reference30 articles.

1. Adleman L.M. On distinguishing prime numbers from composite numbers. — Proc. 21st Symp. on Foundations of Computer Science, IEEE, 1980, 387–406.

2. Barzdin J.M. Complexity of recognition of palindromes by Turing machines. — Problemy kibernetiki, v.15, Moscow, Nauka, 1965, 245–248 (Russian).

3. Chandra A.K. and Stockmeyer L.J. Alternation. — Proc. 17th Symp. on Foundations of Computer Science, IEEE, 1976, 98–108.

4. Freivalds R. Fast computation by probabilistic Turing machines. — Učenye Zapiski Latviiiskogo Gosudarstvennogo Universiteta, v.233, 1975, 201–205. (Russian).

5. Freivalds R. Probabilistic machines can use less running time. Information Processing '77, IFIP, North-Holland, 1977, 839–842.

Cited by 56 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Affine Automata Verifiers;Unconventional Computation and Natural Computation;2021

2. Uncountable Realtime Probabilistic Classes;International Journal of Foundations of Computer Science;2019-12

3. Behavioral Strengths and Weaknesses of Various Models of Limited Automata;SOFSEM 2019: Theory and Practice of Computer Science;2019

4. Uncountable classical and quantum complexity classes;RAIRO - Theoretical Informatics and Applications;2018-04

5. Unary probabilistic and quantum automata on promise problems;Quantum Information Processing;2017-12-26