Volker Strassen is a German mathematician and computer scientist who in 1969 published Strassens algorithm, the first method shown to multiply two matrices in fewer arithmetic operations than the standard row-by-column technique, a result that founded the study of fast matrix multiplication algorithms. With Robert Solovay he also co-developed the Solovay-Strassen primality test, an early probabilistic algorithm for testing whether a large number is prime that became important to public-key cryptography.
Facts
AwardFellow of the American Mathematical Society 2 Connections
Credited
Source Schönhage-Strassen algorithm (Wikipedia)
Source Wikipedia: Strassen's Algorithm
In Field
Source Wikipedia: Volker Strassen
Invented
Volker Strassen co-developed this fast integer multiplication algorithm with Arnold Schonhage in 1971, using fast Fourier transforms.
Volker Strassen published his subcubic matrix multiplication algorithm in 1969, the first to beat the standard cubic-time method.
In the Other Atlases
- Also in Geography Atlas: Germany, nationality there.
Sources
1. Wikipedia: Volker Strassen
Wikimedia FoundationLead section
Volker Strassen (born April 29, 1936) is a German mathematician, a professor emeritus in the department of mathematics and statistics at the University of Konstanz.
- In Field: Algorithms and Complexity Theory, Lead paragraph
View the Source 2. Wikidata: Volker Strassen
Wikipedia: Strassen's Algorithm
Wikimedia FoundationCredited: Strassen's Algorithm, Lead sentenceQuote, Credited: Strassen's Algorithm, Lead sentence
Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication.
Schönhage-Strassen algorithm (Wikipedia)
Credited: Schonhage-Strassen Algorithm, Lead sentenceQuote, Credited: Schonhage-Strassen Algorithm, Lead sentence
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 2^n + 1<
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.