Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
_0ffh
on March 26, 2019
|
parent
|
context
|
favorite
| on:
Integer multiplication in time O(n log n) [pdf]
There's always a time/space tradeoff involved, see for example the Wallace tree multiplier [1], which is indeed O(log n) in time.
[1]
https://en.wikipedia.org/wiki/Wallace_tree
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
[1] https://en.wikipedia.org/wiki/Wallace_tree