Hacker News new | past | comments | ask | show | jobs | submit login

Are you talking about base-2 multiplication for fixed word-length integer? The paper seems to be talking about BigInt multiplication.



I was being facetious as there's usually faster ways, but you can do unlimited length integer multiply with an unlimited length mask/shift/add. Perhaps that is what you mean.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: