Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
integer multiplication
|
| gptkbp:asymptoticComplexity |
O(n log n 2^{O(log^* n)})
|
| gptkbp:author |
gptkb:Martin_Fürer
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Fürer's algorithm
|
| gptkbp:improves |
gptkb:Schönhage–Strassen_algorithm
|
| gptkbp:namedAfter |
gptkb:Martin_Fürer
|
| gptkbp:publicationYear |
2007
|
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
|
| gptkbp:relatedTo |
gptkb:fast_Fourier_transform
integer multiplication complexity |
| gptkbp:significance |
asymptotically fastest known integer multiplication algorithm (as of 2024)
|
| gptkbp:uses |
gptkb:fast_Fourier_transform
modular arithmetic |
| gptkbp:bfsParent |
gptkb:Schönhage–Strassen_algorithm
|
| gptkbp:bfsLayer |
6
|