Bounded Independence Plus Noise Fools Products (Q4641587): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130037534, #quickstatements; #temporary_batch_1726327587925
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for the maximal independent set problem / 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: Almost \(k\)-wise independence versus \(k\)-wise independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endcoding Complexity Versus Minimum Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic Independence Can Fool DNF Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for Read-Once Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for Linear Length Branching Programs and Stack Machines / 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: Universal classes of hash functions / 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: On the power of two-point based sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Independence Fools Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of product distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / 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: A note on the decoding complexity of error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Correlation of Parity and Small-Depth Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness from Shrinkage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for network algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4602401 / 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 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: A Simple Proof of Bazzi’s Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness for Regular Branching Programs via Fourier Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281059 / 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: The Complexity of Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness buys depth for approximate counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for combinatorial checkerboards / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/17m1129088 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2796642617 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130037534 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:42, 14 September 2024

scientific article; zbMATH DE number 6869953
Language Label Description Also known as
English
Bounded Independence Plus Noise Fools Products
scientific article; zbMATH DE number 6869953

    Statements

    Bounded Independence Plus Noise Fools Products (English)
    0 references
    0 references
    0 references
    0 references
    18 May 2018
    0 references
    \(k\)-wise independence
    0 references
    small-bias distributions
    0 references
    noise
    0 references
    Reed-Solomon codes
    0 references
    combinatorial rectangles
    0 references
    pseudorandom generators
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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