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

researchr

You are not signed in
Sign in
Sign up

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.

The following publications are possibly variants of this publication:

On the Succinctness of Different Representations of LanguagesJuris Hartmanis. SICOMP, 9(1):114-120, 1980.

Relative Succinctness of Representations of Languages and Separation of Complexity ClassesJuris Hartmanis, Theodore P. Baker. mfcs 1979: 70-88

runs on WebDSL