External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On Complexity of Nondeterministic Turing Machines Computations

Michal Chytil. On Complexity of Nondeterministic Turing Machines Computations. In Jirí Becvár, editor, Mathematical Foundations of Computer Science 1975, 4th Symposium, Mariánské Lázne, Czechoslovakia, September 1-5, 1975, Proceedings. Volume 32 of Lecture Notes in Computer Science, pages 199-205, Springer, 1975.

Abstract

Abstract is missing.

runs on