Almost k-wise independence versus k-wise independence
References (7)
- et al.
A fast and simple randomized algorithm for the maximal independent set problem
J. Algorithms
(1986) - et al.
Simple constructions of almost k-wise independent random variables
Random Structures Algorithms
(1992) - et al.
The bit extraction problem and t-resilient functions
There are more references available in the full text version of this article.
Cited by (41)
Randomized OBDD-based graph algorithms
2018, Theoretical Computer ScienceA Moment-Matching Approach to Testable Learning and a New Characterization of Rademacher Complexity
2023, Proceedings of the Annual ACM Symposium on Theory of ComputingTesting Distributional Assumptions of Learning Algorithms
2023, Proceedings of the Annual ACM Symposium on Theory of ComputingDETERMINISTIC MASSIVELY PARALLEL CONNECTIVITY
2023, SIAM Journal on Computing
- 1
Research supported in part by a USA Israeli BSF grant, by a grant from the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.
- 2
Supported by the MINERVA Foundation, Germany.
- 3
Research supported in part by a grant from the Israel Science Foundation.
Copyright © 2003 Elsevier B.V. All rights reserved.