A new function algebra of EXPTIME functions by safe nested recursion
From MaRDI portal
Publication:2946581
DOI10.1145/1555746.1555748zbMath1351.03027arXivcs/0607118MaRDI QIDQ2946581
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0607118
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
On sharing, memoization, and polynomial time, A new order-theoretic characterisation of the polytime computable functions, A Formalization of Polytime Functions, A lexicographic path order with slow growing derivation bounds