Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases (Q4564229)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases |
scientific article; zbMATH DE number 6885891
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases |
scientific article; zbMATH DE number 6885891 |
Statements
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases (English)
0 references
12 June 2018
0 references
0 references
0.9112296
0 references
0.90905154
0 references
0.90377444
0 references
0.9004511
0 references
0.89973736
0 references
0.8990186
0 references
0.89840174
0 references
