Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568)
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: Polynomial evaluation over finite fields: new algorithms and complexity bounds |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7744406461715698
0 references
0.7690404653549194
0 references
0.765988290309906
0 references
