Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
systemBuilder
on March 25, 2019
|
parent
|
context
|
favorite
| on:
Integer multiplication in time O(n log n) [pdf]
Andy Yao proved a lower bound on circuit complexity for multiplication of circuit width x depth = Omega(n ^ 2). Trivial carry circuits for adders are O(n).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
