Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810)
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: Efficiently testing sparse GF(2) polynomials |
scientific article; zbMATH DE number 5968731
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently testing sparse \(\text{GF}(2)\) polynomials |
scientific article; zbMATH DE number 5968731 |
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
0 references
0.9949905872344972
0 references
0.8308562636375427
0 references
0.804139256477356
0 references
0.7931958436965942
0 references
0.7827903032302856
0 references
