News for hackers. Stuff that matters.

A comment on Integer multiplication in time O(n log n) [pdf]. Parent comment

Re:Integer multiplication in time O(n log n) [pdf] by chess93 on Monday March 25, 2019 @06:01PM (#19487142)
On the other hand, in practice, log log n is basically constant so we have had a practical n log n algorithm for a while :)
[ Parent | on HN ]

There are no comments on this comment yet.