scientific article; zbMATH DE number 3548469

zbMATH Open0352.68100MaRDI QIDQ4122837FDOQ4122837

Authors: J. Hartmanis, H. B. III Hunt 

Publication date: 1973

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (8)

• A very hard log-space counting class
• New problems complete for nondeterministic log space
• Comparing complexity classes
• Descriptive characterizations of computational complexity
• On the time and tape complexity of weak unification
• Title not available (Why is that?)
• Title not available (Why is that?)
• The maximum value problem and NP real numbers

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)