On the Power of Random Access Machines

@inproceedings{Schnhage1979OnTP,
  title={On the Power of Random Access Machines},
  author={Arnold Sch{\"o}nhage},
  booktitle={ICALP},
  year={1979}
}
  • Arnold Schönhage
  • Published in ICALP 1979
  • Computer Science
  • 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. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 57 CITATIONS

    Equivalence Problems for Circuits over Sets of Natural Numbers

    VIEW 3 EXCERPTS
    HIGHLY INFLUENCED

    Parallel and Sequential Optical Computing

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    Guest Column: NP-complete problems and physical reality

    VIEW 3 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    On the intrinsic complexity of the arithmetic

    VIEW 1 EXCERPT
    CITES BACKGROUND

    FILTER CITATIONS BY YEAR

    1979
    2020

    CITATION STATISTICS

    • 3 Highly Influenced Citations