Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference31 articles.
1. Reductions in the number of heads for the nondeterminacy problem in multihead automata;Beeri,1973
2. On languages accepted in polynomial time;Book;SIAM J. Computing,1972
3. Tape-bounded Turing acceptors and principal AFLs;Book;J. Comput. System Sci.,1970
4. Computational complexity and the existence of complexity gaps;Borodin;J. Assoc. Comput. Mach.,1972
5. Dense and non-dense families of complexity classes;Borodin,1969
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. P-RAM vs. RP-RAM;Theoretical Computer Science;2017-08
2. Bibliography;Theory of Computational Complexity;2013-12-06
3. On the Structure of Logspace Probabilistic Complexity Classes;SIAM Journal on Computing;2000-01
4. Multihead two-way probabilistic finite automata;Theory of Computing Systems;1997-02
5. Multihead two-way probabilistic finite automata;LATIN '95: Theoretical Informatics;1995