MOD_p-tests, almost independence and small probability spaces (extended abstract)
From MaRDI portal
Publication:5047166
Recommendations
- scientific article; zbMATH DE number 1496576
- Improved algorithms via approximations of probability distributions
- Efficient approximation of product distributions
- Simple Constructions of Almost k-wise Independent Random Variables
- Small-Bias Probability Spaces: Efficient Constructions and Applications
Cites work
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 4000052 (Why is no real title available?)
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- A well-characterized approximation problem
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- On construction of \(k\)-wise independent random variables
- On the computational power of depth 2 circuits with threshold and modulo gates
- Quasi-random graphs
- Ramanujan graphs
- Simple Constructions of Almost k-wise Independent Random Variables
- Simulating (log c n )-wise independence in NC
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- The probabilistic method yields deterministic parallel algorithms
Cited in
(2)
This page was built for publication: \(\mathrm{MOD}_p\)-tests, almost independence and small probability spaces (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047166)
