You make a good point, nice catch. Technically we don't know what the fastest po... | Hacker News

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

login

throwawaymath on March 25, 2019 | parent | context | favorite | on: Integer multiplication in time O(n log n) [pdf]

You make a good point, nice catch. Technically we don't know what the fastest possible algorithm is yet.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact