Testing low-degree polynomials over prime fields (Q3055771): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.1002/rsa.20262 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3083444063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages are Testable with a Constant Number of Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved low-degree testing and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / 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: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust locally testable codes and products of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions and polynomials in vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic codes that are invariant under the general linear group / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized ReedMuller codes and their relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight codewords as generators of generalized Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Polynomials over General Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Characterizations of Polynomials with Applications to Program Testing / rank
 
Normal rank

Latest revision as of 11:33, 3 July 2024

scientific article
Language Label Description Also known as
English
Testing low-degree polynomials over prime fields
scientific article

    Statements

    Testing low-degree polynomials over prime fields (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomials
    0 references
    generalized Reed-Muller code
    0 references
    local testing
    0 references
    local correction
    0 references
    0 references