Skip to main content
Conference Proceedings

On power of random access machines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1979) 71 LNCS 520-529
DOI: 10.1007/3-540-09510-1_42
79Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Schönhage, A. (1979). On power of random access machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 520–529). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free