Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMATH Open1145.03314OpenAlexW4255986326MaRDI QIDQ5898804FDOQ5898804

Authors: Douglas Cenzer, Zia Uddin 

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11780342

Recommendations

• Space complexity of abelian groups
• Bridging across the \(\log(n)\) space frontier
• Logspace Reducibility: Models and Equivalences
• Neat function algebraic characterizations of LOGSPACE and LINSPACE
• Regressive computations characterize logarithmic space

zbMATH Keywords

ComplexityComputabilityComputable Model Theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (3)

• Space complexity of abelian groups
• A Note on the Space Complexity of Fast D-Finite Function Evaluation
• Logspace without bounds

This page was built for publication: Logical Approaches to Computational Barriers

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