Regressive computations characterize logarithmic space
From MaRDI portal
Publication:342702
DOI10.1016/J.IC.2016.07.002zbMATH Open1353.68087OpenAlexW2483796587MaRDI QIDQ342702FDOQ342702
Authors: S. Mazzanti 
Publication date: 18 November 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.07.002
Recommendations
- On logarithmic-space computable real numbers
- Logarithmically convergent relaxation computation
- L-recursion and a new logic for logarithmic space
- L-recursion and a new logic for logarithmic space
- Approximation in (poly-) logarithmic space
- Approximation in (Poly-) Logarithmic Space
- Unambiguous functions in logarithmic space
- scientific article; zbMATH DE number 1072535
- scientific article; zbMATH DE number 5245122
- scientific article; zbMATH DE number 4108927
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Cites Work
- LOGSPACE and PTIME characterized by programming languages
- Logspace without bounds
- Programming Languages and Systems
- Title not available (Why is that?)
- A machine description and the hierarchy of initial Grzegorczyk classes
- Predecessor machines
- Neat function algebraic characterizations of LOGSPACE and LINSPACE
- Applicative theories for logarithmic complexity classes
- Title not available (Why is that?)
- Unbounded recursion and non-size-increasing functions
Cited In (2)
This page was built for publication: Regressive computations characterize logarithmic space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342702)
