News for hackers. Stuff that matters.

avi012

Re:Integer multiplication below n log n on Friday October 09, 2026 @04:38PM (#50026283)
Amazing, but...

this is not an algorithm in O(n^2.25), rather it is a proof that such an algorithm exists, but the proof doesn't provide the algorithm, it is a non constructive proof.