Schönhage–Strassen algorithm

Summary

Schönhage–Strassen algorithm is a multiplication algorithm^[1]. It draws 132 Wikipedia views per month (multiplication_algorithm category, ranking #3 of 10).^[2]

Key Facts

• Schönhage–Strassen algorithm's instance of is recorded as multiplication algorithm^[3].
• Arnold Schönhage is named after Schönhage–Strassen algorithm^[4].
• Volker Strassen is named after Schönhage–Strassen algorithm^[5].
• +1971-00-00T00:00:00Z marks the founding of Schönhage–Strassen algorithm^[6].
• Schönhage–Strassen algorithm's Freebase ID is recorded as /m/04w65t^[7].
• Schönhage–Strassen algorithm's worst-case time complexity is recorded as O(n\cdot \log n\cdot \log \log n)^[8].
• Schönhage–Strassen algorithm's Microsoft Academic ID is recorded as 2779785570^[9].

Body

Designation and Status

Schönhage–Strassen algorithm's instance of is recorded as multiplication algorithm^[3].

History and Context

+1971-00-00T00:00:00Z marks the founding of Schönhage–Strassen algorithm^[6]. Things named after include Arnold Schönhage^[4], a mathematician^[10], b. 1934^[11], of Germany^[12], specialised in mathematics^[13] and Volker Strassen^[5], a mathematician^[14], b. 1936^[15], of Germany^[16], awarded the Knuth Prize^[17], specialised in mathematics^[18].

Why It Matters

Schönhage–Strassen algorithm draws 132 Wikipedia views per month (multiplication_algorithm category, ranking #3 of 10).^[2] It has Wikipedia articles in 13 language editions, a strong signal of global cultural recognition.^[19] It is known by 9 alternative names across languages and contexts.^[20]