Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:48, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently testing sparse \(\text{GF}(2)\) polynomials |
scientific article |
Statements
Efficiently testing sparse \(\text{GF}(2)\) polynomials (English)
0 references
7 November 2011
0 references
property testing
0 references
GF(2) polynomials
0 references
sparse polynomials
0 references
randomized algorithms
0 references
