Y
Hacker News
new
|
ask
|
show
|
jobs
by
_0ffh
2642 days ago
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