Author:
Freivalds Rusins,Karpinski Marek
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Allender, E., Beigel, R., Hertrampf, U., and Homer, S., Almost-Everywhere Complexity Hierarchies for Nondeterministic Time, Manuscript, 1992, A preliminary version has appeared in Proc. STACS'90, LNCS 415, Springer-Verlag, 1990, pp. 1–11
2. Borodin, A., Cook, S., and Pippenger, N., Parallel computation for wellendowed rings and space-bounded probabilistic machines, Information and Control 58, pp. 113–136.
3. Bukharaev, R. E., Probabilistic Automata, Kazan University Press, 1977 (Russian).
4. Dwork, C., and Stockmeyer, L., Interactive proof systems with finite state verifiers, Res. Rep. RJ6262. IBM Research Division, San Jose, Calif., May 1988.
5. Dwork, C., and Stockmeyer, L., Finite state verifiers I: The power of interaction, Journal of ACM, 39, 4 (Oct. 1992), pp. 800–828.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Affine Automata Verifiers;Unconventional Computation and Natural Computation;2021
2. Language recognition power and succinctness of affine automata;Natural Computing;2017-11-07
3. New Results on the Minimum Amount of Useful Space;International Journal of Foundations of Computer Science;2016-02
4. Language Recognition Power and Succinctness of Affine Automata;Unconventional Computation and Natural Computation;2016
5. Implications of Quantum Automata for Contextuality;Implementation and Application of Automata;2014