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.

Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages

Theodore P. Baker, Juris Hartmanis. Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages. In 20th Annual Symposium on Foundations of Computer Science, 29-31 October 1979, San Juan, Puerto Rico. pages 392-396, IEEE, 1979.

Authors

Theodore P. Baker

This author has not been identified. Look up 'Theodore P. Baker' in Google

Juris Hartmanis

This author has not been identified. Look up 'Juris Hartmanis' in Google
runs on