Bounded independence versus symmetric tests

DOI10.1145/3337783MaRDI QIDQ5205817zbMATH OpenOpenAlexWikidataFDO

Authors Ravi B. Boppana, Chin Ho Lee, Emanuele Viola, Johan Hastad

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3337783

zbMATH Keywords

bounded independencemoduluspseudorandomnesssymmetric functionsthresholds

Mathematics Subject Classification ID

Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• Bounded independence vs. moduli
• Testing non-uniform \(k\)-wise independent distributions over product spaces (extended abstract)
• Robust characterizations of k-wise independence over product spaces and related testing results
• scientific article; zbMATH DE number 7378666
• Almost \(k\)-wise independence versus \(k\)-wise independence

Cited in

(8)

• Robust characterizations of k-wise independence over product spaces and related testing results
• Hypothesis Testing for Equivalence Defined on Symmetric Open Intervals
• Testing non-uniform \(k\)-wise independent distributions over product spaces (extended abstract)
• Bounded independence vs. moduli
• scientific article; zbMATH DE number 871159 (Why is no real title available?)
• The coin problem for product tests
• More on bounded independence plus noise: pseudorandom generators for read-once polynomials
• Pseudorandomness, symmetry, smoothing: I

This page was built for publication: Bounded independence versus symmetric tests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5205817)