Q5140841 (Q5140841): 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.4086/toc.2020.v016a007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3124301230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Independence Can Fool DNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for Read-Once Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence versus Symmetric Tests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms via approximations of probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudorandomness for unordered branching programs through local monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of product distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness via the Discrete Fourier Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators for Combinatorial Shapes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Plus Noise Fools Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002801 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudorandom generators for combinatorial rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Bias Probability Spaces: Efficient Constructions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom bits for constant depth circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness is linear in space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Bits for Constant‐Depth Circuits with Few Arbitrary Symmetric Gates / 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: Randomness buys depth for approximate counting / rank
 
Normal rank

Latest revision as of 05:17, 24 July 2024

scientific article; zbMATH DE number 7286917
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7286917

    Statements

    0 references
    0 references
    17 December 2020
    0 references
    pseudorandom generators
    0 references
    bounded independence plus noise
    0 references
    branching programs
    0 references
    read-once polynomials
    0 references

    Identifiers

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