On the Power of Random Access Machines

@inproceedings{Schnhage1979OnTP,
  title={On the Power of Random Access Machines},
  author={A. Sch{\"o}nhage},
  booktitle={ICALP},
  year={1979}
}
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. 
118 Citations
Division is good
  • J. Simon
  • Computer Science
  • 20th Annual Symposium on Foundations of Computer Science (sfcs 1979)
  • 1979
  • 13
Division in Idealized Unit Cost RAMS
  • J. Simon
  • Computer Science
  • J. Comput. Syst. Sci.
  • 1981
  • 17
On the complexity of RAM with various operation sets
  • 10
Computing with and without Arbitrary Large Numbers
  • M. Brand
  • Computer Science, Mathematics
  • TAMC
  • 2013
  • 4
  • PDF
P-RAM vs. RP-RAM
  • M. Brand
  • Computer Science
  • Theor. Comput. Sci.
  • 2017
  • 1
The RAM equivalent of P vs. RP
  • PDF
On the Complexity of Genuinely Polynomial Computation
  • 4
Does indirect addressing matter?
  • M. Brand
  • Computer Science
  • Acta Informatica
  • 2012
  • 4
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
On time versus space and related problems
  • 86
A Characterization of the Power of Vector Machines
  • 85
On the Power of Multiplication in Random Access Machines
  • 89
  • PDF
A characterization of the power of vector machines
  • 87
Storage Modification Machines
  • 174
A Fast Monte-Carlo Test for Primality
  • 624