On the power of random access machines
We study the power of deterministic successor RAM's with extra instructions like +,*,⋎ and the associated classes of problems decidable in polynomial time. Our main results are NP ... PTIME (+,*,⋎) and PTIME(+,*) ... RP, where RP denotes the class of problems randomly decidable (by probabilistic TM's) in polynomial time.
Unable to display preview. Download preview PDF.
- J. Hartmanis and J. Simon, On the power of multiplication in random access machines. IEEE Conf. Rec. 15th Symp. Switching Automata Theory (1974) 13–23.Google Scholar
- J. E. Hopcroft, W. J. Paul and L. G. Valiant, On time versus space and related problems. Proc. 16th Ann. IEEE Symp. Foundations Comp. Sci. Berkeley (1975) 57–64.Google Scholar
- V. Pratt, L. Stockmeyer, M. O. Rabin, A characterization of the power of vector machines. Proc. 6th Ann. ACM Symp. Theor. Comp. (1974) 122–134.Google Scholar
- A. Schönhage, Storage modification machines. Preprint, Universität Tübingen (1978), submitted to SIAM J. Comput.Google Scholar
- J. Simon, On feasible numbers. Proc. 9th ACM Symp. Theor. Comp., Boulder (1977) 195–207.Google Scholar
- R. Solovay, V. Strassen, A fast Monte-Carlo test for primality. SIAM J. Comput. 6 (1977), 84–85.Google Scholar