Schönhage–Strassen algorithmSchönhage–Strassen algorithm
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers, published by Arnold Schönhage and Volker Strassen in 1971. It works by recursively applying fast Fourier transform (FFT) over the integers modulo
Excerpt from the Wikipedia article “Schönhage–Strassen algorithm”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Dcoetzee, CC0, via Wikimedia Commons.
Open free boosters and add Schönhage–Strassen algorithm to your collection.
Play for free

