Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1102.4772 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3688305 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4190138 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3765876 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3935355 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5560620 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Semi-Fast Fourier Transforms over GF(2<sup>m</sup>). / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4146667 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4343015 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: ON THE NUMBER OF MULTIPLICATIONS REQUIRED TO COMPUTE CERTAIN FUNCTIONS / rank | |||
Normal rank | |||
Latest revision as of 00:18, 6 July 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
