---

Lad alfa være den funktion der forekommer i kompleksitetsanalysen for
union-find-algoritmen med løbende komprimering, og som normalt kaldes
"invers ackermann".

Gælder det at alfa(n^a) = O(alfa(n)) for n -> oo og et givet fast a>1 ?

--
Henning Makholm "And why should I talk slaves' and fools' talk? I
don't want him to live for ever, and I know that he's
not going to live for ever whether I want him to or not."