Ein vollständiges Problem auf der Baummaschine

  • H. Bremer
Vorträge In Der Reihenfolge Des Programms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 48)


Random Access Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Borodin: On Relating Time and Space to Size and Depth 1976Google Scholar
  2. 2.
    S. Cook: The Complexity of Theorem-proving Procedures, 3rd ACM Symp., S. 151–158Google Scholar
  3. 3.
    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–23Google Scholar
  4. 4.
    V. Pratt, L. Stockmeyer, M.O. Rabin: A Characterization of the Power of Vektor Machines. 6th ACM Symp., S. 122–134Google Scholar
  5. 5.
    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–9Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • H. Bremer

There are no affiliations available

Personalised recommendations