Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity (Q3058727): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:46, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity |
scientific article |
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
