Efficiently testing sparse \(\text{GF}(2)\) polynomials (Q644810): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9426-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092680385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-testing/correcting with applications to numerical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple learning algorithms using divide and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning multivariate polynomials under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Learning Algorithms for Decision Trees and Multivariate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3152421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Learning Ring-Sum-Expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing and its connection to learning and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5748889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Number of Zeroes of a GF[2] Polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Interpolation and Approximation of Sparse Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Basic Boolean Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3615896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning sparse multivariate polynomials over a field with queries and counterexamples. / rank
 
Normal rank

Latest revision as of 15:34, 4 July 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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    property testing
    0 references
    GF(2) polynomials
    0 references
    sparse polynomials
    0 references
    randomized algorithms
    0 references
    0 references