A new function algebra of EXPTIME functions by safe nested recursion

DOI10.1145/1555746.1555748zbMath1351.03027arXivcs/0607118OpenAlexW2091393031MaRDI QIDQ2946581

Naohi Eguchi, Toshiyasu Arai

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

zbMATH Keywords

implicit computational complexityEXPTIME

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (4)

On sharing, memoization, and polynomial time ⋮ A lexicographic path order with slow growing derivation bounds ⋮ A Formalization of Polytime Functions ⋮ A new order-theoretic characterisation of the polytime computable functions

This page was built for publication: A new function algebra of EXPTIME functions by safe nested recursion