Random low-degree polynomials are hard to approximate (Q430841): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the density of sets of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Sample Spaces Cannot Fool Low Degree Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine dispersers from subspace polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the trace of finite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of Szemerédi's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weight structure of Reed-Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weight enumeration of weights less than 2.5d of Reed—Muller codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weight Distribution and List-Decoding Size of Reed–Muller Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness vs randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank

Latest revision as of 10:20, 5 July 2024

scientific article
Language Label Description Also known as
English
Random low-degree polynomials are hard to approximate
scientific article

    Statements

    Random low-degree polynomials are hard to approximate (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    random polynomials
    0 references
    Reed-Muller codes
    0 references
    0 references