A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (Q5317184)
From MaRDI portal
scientific article; zbMATH DE number 2205880
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields |
scientific article; zbMATH DE number 2205880 |
Statements
A Lower Bound on the Complexity of Polynomial Multiplication over Finite Fields (English)
0 references
16 September 2005
0 references
polynomial multiplication
0 references
finite fields
0 references
quadratic algorithms
0 references
