Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity (Q6113915): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 06:20, 10 July 2024
scientific article; zbMATH DE number 7724809
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity |
scientific article; zbMATH DE number 7724809 |
Statements
Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity (English)
0 references
10 August 2023
0 references
Chudnovsky-type algorithms
0 references
multiplication in finite fields
0 references
polynomial time
0 references
linear bilinear complexity
0 references
