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.

Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets

Michael I. Dekhtyar. Bounds on Computational Complexity and Approximability of Initial Segments of Recursive Sets. In Jirí Becvár, editor, Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979. Volume 74 of Lecture Notes in Computer Science, pages 277-283, Springer, 1979.

Abstract

Abstract is missing.

runs on