Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Logical Approaches to Computational Barriers

From MaRDI portal
Publication:5898804
Jump to:navigation, search

DOI10.1007/11780342zbMATH Open1145.03314OpenAlexW4255986326MaRDI QIDQ5898804

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



zbMATH Keywords

ComplexityComputabilityComputable Model Theory


Mathematics Subject Classification ID

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



Related Items (2)

A Note on the Space Complexity of Fast D-Finite Function Evaluation ⋮ Space complexity of abelian groups






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5898804&oldid=16738808"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 20:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki