News for hackers. Stuff that matters.
Re:Researchers achieve ‘absurdly fast’ algorithm for network... by pfdietz on Thursday June 09, 2022 @08:52AM (#31680595)
Or, rather, it grows more slowly than m^(1 + epsilon) for any fixed epsilon > 0.

The function m log m is m^(1 + o(1)) but it grows more quickly than linear.

There are no comments on this comment yet.