News for hackers. Stuff that matters.
Re:Integer multiplication in time O(n log n) [pdf] by tombert on Monday March 25, 2019 @12:09PM (#19483777)
Wow, I learned something today; I had always thought of integer multiplication as a constant-time operation.

This is why I love computer science, no matter how much I think I know, I can feel like an idiot a day later.

Re:Integer multiplication in time O(n log n) [pdf] by pragmaticpandy on Monday March 25, 2019 @09:58PM (#19488643)
If by integer you mean the four or so bytes that many languages use to represent a (bounded) int, then it is indeed constant. This is often the context in software engineering.
Re:Integer multiplication in time O(n log n) [pdf] by tombert on Monday March 25, 2019 @11:05PM (#19488940)
I'm somewhat interested in compiler and computation theory, so this is why it was a surprise to me.
Re:Integer multiplication in time O(n log n) [pdf] by davidivadavid on Tuesday March 26, 2019 @02:21AM (#19489649)
For some reason, a lot of people seem to think that operations that have a low level implementation (e.g. basic instruction in some ISA) are O(1).