News for hackers. Stuff that matters.

A comment on Faster remainders when the divisor is a constant: beating compilers & libdivide. Parent comment

Re:Faster remainders when the divisor is a constant: beating... by nitrogen on Friday February 08, 2019 @11:18PM (#19120696)
It's conceivable that multiplication time might be proportional to the number of 1 bits in the multiplier.
[ Parent | on HN ]

There are no comments on this comment yet.