Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
A. Schönhage, Storage modification machines. Preprint, Universität Tübingen (1978), submitted to SIAM J. Comput.
J. Simon, On feasible numbers. Proc. 9th ACM Symp. Theor. Comp., Boulder (1977) 195–207.
R. Solovay, V. Strassen, A fast Monte-Carlo test for primality. SIAM J. Comput. 6 (1977), 84–85.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schönhage, A. (1979). On the power of random access machines. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_42
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive