Hacker News
- Integer multiplication in time O(n log n) [pdf] https://hal.archives-ouvertes.fr/hal-02070778/document 67 comments
- Integer multiplication in time O(n log n) [PDF] https://hal.archives-ouvertes.fr/hal-02070778/document 5 comments compsci
- Integer multiplication in time O(n log n) [PDF] https://hal.archives-ouvertes.fr/hal-02070778/document 39 comments programming
- Harvey and Van Der Hoeven claim to have found an O(n log n) integer multiplication algorithm. This would make significant progress on a conjecture that has been open for almost 50 years. https://hal.archives-ouvertes.fr/hal-02070778/document 141 comments math
- TeXmacs creator is coauthor on paper that shows how to multiply integers in O(n log n) time. https://hal.archives-ouvertes.fr/hal-02070778/document 34 comments compsci
Linking pages
- I Got a Knuth Check for 0x$3.00 | Something Something Programming https://nickdrozd.github.io/2019/05/17/knuth-check.html 195 comments
- Mathematicians Discover the Perfect Way to Multiply | WIRED https://www.wired.com/story/mathematicians-discover-the-perfect-way-to-multiply/ 70 comments
- Mathematicians have found a new way to multiply two numbers together | New Scientist https://www.newscientist.com/article/2198155-mathematicians-have-found-a-new-way-to-multiply-two-numbers-together/ 6 comments
- Multiplication Reinvented | CNRS News https://news.cnrs.fr/articles/multiplication-reinvented 5 comments
- Weird ways to multiply really fast with Karatsuba, Toom–Cook and Fourier https://www.entropy1729.com/divide-and-conquer-fourier/ 0 comments
- We've found a quicker way to multiply really big numbers https://theconversation.com/weve-found-a-quicker-way-to-multiply-really-big-numbers-114923 0 comments
Would you like to stay up to date with Computer science? Checkout Computer science
Weekly.
Related searches:
Search whole site: site:hal.archives-ouvertes.fr
Search title: Integer multiplication in time O(n log n) [pdf]
See how to search.