Adventures in time and space
From MaRDI portal
Publication:5310685
DOI10.2168/LMCS-3(1:9)2007zbMath1128.03030OpenAlexW3104440546MaRDI QIDQ5310685
Publication date: 11 October 2007
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-3(1:9)2007
Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)
Related Items
Denotational semantics as a foundation for cost recurrence extraction for functional languages, Type-two polynomial-time and restricted lookahead, Two algorithms in search of a type-system, Axiomatizing Resource Bounds for Measure