Advertisement

On the structure of complexity classes

  • Ronald V. Book
Thursday Afternoon
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)

Keywords

Turing Machine Complexity Class Space Bound Finite Alphabet Translational Technique 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aanderaa, S., On k-tape versus (k+1)-tape real-time computation, to appear.Google Scholar
  2. 2.
    Book, R., On languages accepted in polynomial time, SIAM J. Computing 1 (1972), 281–287.CrossRefGoogle Scholar
  3. 3.
    Book, R., Comparing complexity classes, J. Computer System Sci., to appear.Google Scholar
  4. 4.
    Book, R., Translational lemmas, polynomial time, and (lg n)j-space, submitted for publication.Google Scholar
  5. 5.
    Cook, S., Characterizations of pushdown machines in terms of time-bounded computers, JACM 18 (1971), 4–18.CrossRefGoogle Scholar
  6. 6.
    Cook, S., A hierarchy for nondeterministic time complexity, J. Computer System Sci. 7 (1973), 343–353.Google Scholar
  7. 7.
    Greibach, S., The hardest context-free language, SIAM J. Computing 2 (1973), 304–310.CrossRefGoogle Scholar
  8. 8.
    Hartmanis, J., H. Hunt, The LBA problem and its importance in the theory of computing, Cornell University Technical Report.Google Scholar
  9. 9.
    Ibarra, O., A note concerning nondeterministic tape complexities, JACM 19 (1972), 608–612.CrossRefGoogle Scholar
  10. 10.
    Ruby, S., P.C. Fischer, Translational methods and computational complexity, Conf. Record IEEE Sixth Annual Symp. on Switching Circuit Theory and Logical Design (1965), 173–178.Google Scholar
  11. 11.
    Savitch, W., Relationships between nondeterministic and deterministic tape complexities, J. Computer System Sci. 4 (1970), 177–192.Google Scholar
  12. 12.
    Book, R., Tally languages and complexity classes, Information and Control, to appear.Google Scholar
  13. 13.
    Savitch, W., A note on multihead automata and context-sensitive languages, ACTA Informatica 2 (1973), 249–252.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Ronald V. Book
    • 1
  1. 1.Center for Research in Computing Technology Division of Engineering and Applied PhysicsHarvard UniversityCambridgeU.S.A.

Personalised recommendations