Schönhage-Strassen algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Etymology

[edit]

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

Proper noun

[edit]

Schönhage-Strassen algorithm

  1. (computing theory) An asymptotically fast recursive multiplication algorithm for large integers.