Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (Q395606): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Constructions of Almost k-wise Independent Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Independence Can Fool DNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic independence fools <i>AC</i> <sup>0</sup> circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sum of \(D\) small-bias generators fools polynomials of degree \(D\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inclusion-exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bit Generators That Fool Modular Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Spaces for Group Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / 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 06:52, 7 July 2024

scientific article
Language Label Description Also known as
English
Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields
scientific article

    Statements

    Pseudorandom generators for \(\mathrm{CC}^0[p]\) and the Fourier spectrum of low-degree polynomials over finite fields (English)
    0 references
    0 references
    0 references
    0 references
    29 January 2014
    0 references
    small-depth circuits
    0 references
    low-degree polynomials
    0 references
    pseudorandom generators
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references