This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Literatur
A. Borodin: On Relating Time and Space to Size and Depth 1976
S. Cook: The Complexity of Theorem-proving Procedures, 3rd ACM Symp., S. 151–158
Juris Hartmanis, Janos Simon: On the Power of Multiplication in Random Access Machines. 15th Annual Symposium on Switching and Automata Theory, New Orleans, 1974, S. 13–23
V. Pratt, L. Stockmeyer, M.O. Rabin: A Characterization of the Power of Vektor Machines. 6th ACM Symp., S. 122–134
L.J. Stockmeyer, A.R. Meyer: Word Problems Requiring Exponential Time. Proceedings of 5th Annual ACM Symposium on Theory of Computing, Austin, Texas 1973, S. 1–9
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bremer, H. (1977). Ein vollständiges Problem auf der Baummaschine. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_32
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive