scientific article; zbMATH DE number 3548469

MaRDI QIDQ4122837zbMATH OpenFDO

Authors J. Hartmanis, H. B. III Hunt

Publication date 1973

Mathematics Subject Classification ID

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

Cited in

(8)

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

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)