Improving the classification of complexities
From MaRDI portal
Recommendations
Cited in
(4)- scientific article; zbMATH DE number 4021119 (Why is no real title available?)
- Complexity theory made easy. The formal language approach to the definition of complexity classes
- 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)