Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (Q3058727)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5823311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity |
scientific article; zbMATH DE number 5823311 |
Statements
Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (English)
0 references
7 December 2010
0 references
Charlier polynomials
0 references
binary field representation
0 references
polynomial multiplication
0 references
subquadratic space complexity
0 references
0.93296194
0 references
0.90260375
0 references
0.9006648
0 references
0.8965503
0 references
0.8839125
0 references
0.88262933
0 references
0.88126475
0 references
