Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1102.4772 / rank | |||
Normal rank | |||
Revision as of 16:58, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial evaluation over finite fields: new algorithms and complexity bounds |
scientific article |
Statements
Polynomial evaluation over finite fields: new algorithms and complexity bounds (English)
0 references
13 December 2012
0 references
polynomial evaluation
0 references
finite fields
0 references
syndrome computation
0 references
Reed-Solomon codes
0 references
