On the power of random access machines

  • Arnold Schönhage
Conference paper

DOI: 10.1007/3-540-09510-1_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • Arnold Schönhage
    • 1
  1. 1.Mathematisches Institut der Universität TübingenGermany

Personalised recommendations