Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W.J. Paul, J. Simon: Decision Trees and Random Access Machines. Symp. über Logik und Algorithmik, Zürich, 1980
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, 1980
A. Borodin, I. Monroe: The computational Complexity of algebraic and numeric Problems. New York, Elsevier, 1975
L. van der Waerden: Algebra. Band 1, Springer Verlag, Berlin, Heidelberg, New York, 1966
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
auf der Heide, F.M., Rollik, A. (1981). Random access machines and straight-line programs. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive