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.

Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)

Janos Simon. Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version). In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, 11-13 May 1981, Milwaukee, Wisconsin, USA. pages 158-167, ACM, 1981.

Abstract

Abstract is missing.

runs on