Schönhage–Strassen algorithm
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
integer multiplication
|
| gptkbp:category |
multiplication algorithms
|
| gptkbp:complexity |
O(n log n log log n)
|
| gptkbp:fasterThan |
gptkb:Karatsuba_algorithm
gptkb:Toom–Cook_algorithm |
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Schönhage–Strassen algorithm
|
| gptkbp:input |
two n-digit integers
|
| gptkbp:introducedIn |
1971
|
| gptkbp:namedAfter |
gptkb:Volker_Strassen
gptkb:Arnold_Schönhage |
| gptkbp:output |
product of two n-digit integers
|
| gptkbp:replacedBy |
gptkb:Fürer's_algorithm
|
| gptkbp:significance |
first practical algorithm for fast multiplication of very large integers
|
| gptkbp:usedFor |
large integer multiplication
|
| gptkbp:uses |
gptkb:Fast_Fourier_Transform
|
| gptkbp:bfsParent |
gptkb:Volker_Strassen
|
| gptkbp:bfsLayer |
5
|