The Inverse of Ackermann Function is Computable in Linear Time

DOI10.3233/FI-2021-2077MaRDI QIDQ5025055zbMATH OpenFDO

Authors 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

complexity of computationrecursive functions

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A minimum spanning tree algorithm with inverse-Ackermann type complexity
• Computational Complexity
• Efficiency of a Good But Not Linear Set Union Algorithm
• Mathematical logic. A course with exercises. Part II. Recursion theory, Gödel's theorems, set theory, model theory. Translated from the 1993 French original by Donald H. Pelletier
• Subcomputable Hausdorff function dimension
• Theory of computation
• Top-Down Analysis of Path Compression

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5025055)