On 04/06/2012 10:25 PM, Kevin Wampler wrote:
> On 6/4/2012 2:12 PM, Orchid Win7 v1 wrote:
>> I was reading a description for a computer algorithm. Get this, the
>> authors claim that the time-complexity is proportional to the "inverse
>> Ackermann function".
>
> Union-find structures I assume?

Actually, something much more complicated than that.

> You could of course look a proof and read through it.

I saw the proof. It's about 20 pages of dense formulas. Clearly I'd need 
to study it very carefully to figure out what the hell is going on...

Post a reply to this message