scientific article; zbMATH DE number 3548469

MaRDI QIDQ4122837zbMATH OpenFDO

Authors J. Hartmanis, H. B. III Hunt

Publication date 1973

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cited in

(8)

• New problems complete for nondeterministic log space
• A very hard log-space counting class
• scientific article; zbMATH DE number 3507976 (Why is no real title available?)
• Descriptive characterizations of computational complexity
• The maximum value problem and NP real numbers
• On the time and tape complexity of weak unification
• Comparing complexity classes
• scientific article; zbMATH DE number 3668006 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4122837)