The Inverse of Ackermann Function is Computable in Linear Time

DOI10.3233/FI-2021-2077MaRDI QIDQ5025055

Claude Sureson

Publication date: 1 February 2022

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.06084

zbMATH Keywords

recursive functionscomplexity of computation

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Subcomputable Hausdorff function dimension
• Efficiency of a Good But Not Linear Set Union Algorithm
• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Top-Down Analysis of Path Compression
• Computational Complexity
• Theory of Computation

This page was built for publication: The Inverse of Ackermann Function is Computable in Linear Time