On the other hand, in practice, log log n is basically constant so we have had a...

		chess93 on March 25, 2019 \| parent \| context \| favorite \| on: Integer multiplication in time O(n log n) [pdf] 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 :)