About this page

Multiplication Hits the Speed Limit – Communications of the ACM

https://cacm.acm.org/news/multiplication-hits-the-speed-limit

“A paper posted online in March 2019 presents what may be essentially the fastest possible algorithm for one of the oldest problems in mathematics: whole number multiplication. The new algorithm, which can multiply two n-digit numbers in approximately n(logn) steps, breaks all previous records and...” (from the page’s text)

Topic: Science › Computer Science
Quality: Quality 84 scored 11 Aug 2025
Language: english
Text on page: 12,105 characters
Page size: 134 kB
Answered: OK (200), HTML
Last read: 7 Jul 2025
In our index since: 7 Jul 2025
Safe search: Not checked yet
Links to it: No other site we've read links here yet

Tools for this page

Other sites that can tell you more. Plain links: we don't track where you go.

About the site

Domain owner ICANN registration lookup
Certificates certificate transparency, subdomains
Safety check Safe Browsing status
Trackers The Markup's Blacklight
Is it down? for everyone, or just you

Discussions

Hacker News stories linking here
Reddit posts from this site
Wikipedia articles mentioning the site

For web makers

PageSpeed Lighthouse report
HTML validator W3C
Accessibility WAVE by WebAIM
Security headers

Who links to it

We haven't seen any links to this page yet. That usually means we haven't crawled the pages that link to it, not that there are none.

“Not rated yet” and similar notes are shown on purpose: we say what we haven't measured, so the page doesn't look emptier or better than it is.