Polynomial constructions of Chudnovsky-type algorithms for multiplication in finite fields with linear bilinear complexity (Q6113915): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-031-22944-2_3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4314937957 / rank | |||
Normal rank | |||
Revision as of 10:08, 30 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
