Comment by mFixman

> We give a deterministic algorithm that multiplies two n-bit integers in O(n (log n)^(1−κ)) worst- case time, with κ = 2^(−182).

LMAO, I don't think I ever saw such a small number in a CS result.