Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:appliesTo |
integer multiplication
|
| gptkbp:author |
gptkb:Martin_Fürer
|
| gptkbp:complexity |
O(n log n 2^{O(log^* n)})
|
| gptkbp:field |
gptkb:mathematics
computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Fürer algorithm
|
| gptkbp:improves |
gptkb:Schönhage–Strassen_algorithm
|
| gptkbp:introducedIn |
2007
|
| gptkbp:namedAfter |
gptkb:Martin_Fürer
|
| gptkbp:notableFor |
asymptotically fastest known integer multiplication (as of 2007)
|
| gptkbp:publishedIn |
gptkb:Annals_of_Mathematics
Faster Integer Multiplication |
| gptkbp:bfsParent |
gptkb:Martin_Fürer
|
| gptkbp:bfsLayer |
8
|