Word.ws English Dictionary

Schönhage-Strassen algorithm

Schönhage-Strassen algorithm proper noun: an asymptotically fast recursive multiplication algorithm for large integers.

Proper noun

Schönhage-Strassen algorithm

  1. An asymptotically fast recursive multiplication algorithm for large integers.

Origin of Schönhage-Strassen algorithm

Developed by Arnold Schönhage and Volker Strassen in 1971.

Questions about Schönhage-Strassen algorithm

What does Schönhage-Strassen algorithm mean?
Schönhage-Strassen algorithm means an asymptotically fast recursive multiplication algorithm for large integers.
What part of speech is Schönhage-Strassen algorithm?
Schönhage-Strassen algorithm is a proper noun.

Words near Schönhage-Strassen algorithm in the dictionary

  1. schynbalds
  2. schyphozoan
  3. Schönbergian
  4. Schöneberg
  5. Schönhage
  6. Schönhage-Strassen algorithm
  7. Schönhardt
  8. Schönhardt polyhedra
  9. Schönhardt polyhedron
  10. schönite
  11. Schönlein-Henoch purpura

Source and license

Adapted from Wiktionary: Schönhage-Strassen algorithm (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.

Last updated:

Cite this entry: “Schönhage-Strassen algorithm.” Word.ws, https://word.ws/sch%C3%B6nhage-strassen_algorithm. Based on Wiktionary, CC BY-SA 4.0.