Efficient approximation of product distributions

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199808)13:1<1::AID-RSA1>3.0.CO;2-W" /><1::AID-RSA1>3.0.CO;2-W 10.1002/(SICI)1098-2418(199808)13:1<1::AID-RSA1>3.0.CO;2-WzbMath0959.68553OpenAlexW1967680338MaRDI QIDQ4705321

Michael Luby, Noam Nisan, Oded Goldreich, Guy Even, Boban Velickovic

Publication date: 19 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199808)13:1<1::aid-rsa1>3.0.co;2-w

zbMATH Keywords

uniformly distributed random variables

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (19)

Adding cardinality constraints to integer programs with applications to maximum satisfiability ⋮ Envy-free pricing with general supply constraints for unit demand consumers ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Pseudorandomness via the Discrete Fourier Transform ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ Unnamed Item ⋮ Pseudorandom generators for combinatorial checkerboards ⋮ Deterministic Massively Parallel Connectivity ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ On the derandomization of the graph test for homomorphism over groups ⋮ Counting Solutions to Polynomial Systems via Reductions ⋮ Randomness buys depth for approximate counting ⋮ Bounded Independence Plus Noise Fools Products ⋮ Cost-sharing mechanisms for network design ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521547 Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma] ⋮ Fourier bounds and pseudorandom generators for product tests ⋮ Bounded Indistinguishability and the Complexity of Recovering Secrets ⋮ Unnamed Item ⋮ Robust characterizations of k -wise independence over product spaces and related testing results

This page was built for publication: Efficient approximation of product distributions