Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (Q5066949): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q114071088, #quickstatements; #temporary_batch_1706518640034 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:00, 8 February 2024
scientific article; zbMATH DE number 7500718
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) |
scientific article; zbMATH DE number 7500718 |
Statements
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) (English)
0 references
31 March 2022
0 references
polynomial multiplication
0 references
integer multiplication
0 references
algorithm
0 references
complexity bound
0 references
FFT
0 references
finite field
0 references
