News for hackers. Stuff that matters.
Re:Researchers achieve ‘absurdly fast’ algorithm for network... by mauricioc on Thursday June 09, 2022 @04:51AM (#31679003)
Yes. (log n)/(n^epsilon) tends to zero for any positive epsilon, and so log n = n^(o(1)). The same holds for (log n)^k.

There are no comments on this comment yet.