Improving the classification of complexities

MaRDI QIDQ3446172zbMATH OpenFDO

Authors Angel Garrido

Publication date 14 June 2007

Full work available at URL https://eudml.org/doc/127882

zbMATH Keywords

complexity classspace hierarchytime hierarchyTuring machine

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Classification and complexity of problems.
• scientific article; zbMATH DE number 218387
• scientific article; zbMATH DE number 2040898
• scientific article; zbMATH DE number 4003531
• scientific article; zbMATH DE number 3864492

Cited in

(4)

• scientific article; zbMATH DE number 4021119 (Why is no real title available?)
• scientific article; zbMATH DE number 2040898 (Why is no real title available?)
• Polynomially bounded sequences and polynomial sequences
• Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories

This page was built for publication: Improving the classification of complexities

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