Random access machines and straight-line programs

  • Friedhelm Meyer auf der Heide
  • Anton Rollik
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)


A method to simulate random access machines by decision trees with unbounded degree is used to prove that every random access machine with operation set {+,−,*} and indirect addressing which evaluates a polynomial can be simulated by a straight-line program without any loss of time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. i).
    W.J. Paul, J. Simon: Decision Trees and Random Access Machines. Symp. über Logik und Algorithmik, Zürich, 1980Google Scholar
  2. ii).
    P. Klein, F. Meyer auf der Heide: Lower Time Bounds for the Knapsack problem on several Random Access Machines. Proc. of the 10. GI-Jahrestagung, Saarbrücken, W.-Germany, 1980Google Scholar
  3. iii).
    A. Borodin, I. Monroe: The computational Complexity of algebraic and numeric Problems. New York, Elsevier, 1975Google Scholar
  4. iv).
    L. van der Waerden: Algebra. Band 1, Springer Verlag, Berlin, Heidelberg, New York, 1966Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Friedhelm Meyer auf der Heide
    • 1
  • Anton Rollik
    • 2
  1. 1.University of Bielefeld Faculty of MathematicsBielefeld 1W.-Germany
  2. 2.University of Dortmund Faculty of MathematicsDortmundW.-Germany

Personalised recommendations