Schönhage-Strassen algorithm

proper noun

An asymptotically fast recursive multiplication algorithm for large integers.

Meanings

proper noun
  1. computerAn asymptotically fast recursive multiplication algorithm for large integers.

Origin

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

Full word history & related roots →
Cite this entry
APA

Schönhage-Strassen algorithm. (n.d.). In WatkinsX Dictionary. Retrieved November 4, 2026, from https://dictionary.watkinsx.com/word/Sch%C3%B6nhage-Strassen%20algorithm

MLA

“Schönhage-Strassen algorithm.” WatkinsX Dictionary, https://dictionary.watkinsx.com/word/Sch%C3%B6nhage-Strassen%20algorithm. Accessed November 4, 2026.

Chicago

WatkinsX Dictionary, s.v. “Schönhage-Strassen algorithm,” accessed November 4, 2026, https://dictionary.watkinsx.com/word/Sch%C3%B6nhage-Strassen%20algorithm.

Source: Schönhage-Strassen algorithm on Wiktionary, CC BY-SA 4.0.