Modp-tests, almost independence and small probability spaces

Random Structures and Algorithms

Volumn 16, Issue 4, 2000, Pages 293-313

  Bertram Kretzberg, Claudia ^a   Lefmann, Hanno ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034344131     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200007)16:4<293::AID-RSA1>3.0.CO;2-F     Document Type: Article

References (29)

1. N. Alon, L. Babai, and A. Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, J. Algorithms, 7 (1985), 567-583.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs, IEEE Trans Inform Theory, 38 (1992), 509-516.
3. N. Alon, O. Goldreich, J. Håstad, and R. Peralta, Simple constructions of almost k-wise independent random variables, Random Struct Alg, 3 (1992), 289-304 (Addendum: Random Struct Alg, 4 (1993), 119-120).
4. N. Alon and Y. Mansour, ε-discrepancy sets and their application for interpolation of sparse polynomials, Inform Process Lett 54 (1995), 337-342.
5. N. Alon and J. Spencer, The Probabilistic Method, John Wiley & Sons, New York, 1992.
6. Y. Azar, R. Motwani, and J. Naor, Approximating probability distributions using small sample spaces, Combinatorica, 18 (1998), 151-171.
7. L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity Theory, Pro 27th Annual IEEE Symp Foundations of Computer Science FOCS '86, 1986, pp. 337-347.
8. J. Beck and W. Chen, Irregularities of Distribution, Cambridge University Press, Cambridge, UK, 1987.
9. c-wise independence in NC, J ACM, 38 (1991), 1026-1046.
10. p-circuits, manuscript, 1997.
11. S. Chari, P. Rohatgi, and A. Srinivasan, Improved algorithms via approximations of probability distributions, Proc. 26th Annual Symp Theory of Computing STOC '94, 1994, pp. 584-592.
12. B. Chor and O. Goldreich, On the power of two-point based sampling, J Complexity, 5 (1989), 96-106.
13. F.R.K. Chung, R.L. Graham, and R.M. Wilson, Quasi-random graphs, Combinatorica, 9 (1989), 345-362.
14. G. Even, Construction of small probability spaces for deterministic simulation, M.Sc. thesis, Technion, Haifa, Israel, 1991.
15. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković, Approximations of general independent distributions, Proc. 24th Annual ACM Symp Theory of Computing STOC '92, 1992, pp. 10-16; Efficient approximations to probability distributions, Random Struct Alg 13 (1997), 1-16; Efficient approximations of general distributions, //http://theory.lcs.mit.edu/̃oded/eglnv.html, 1997.
16. G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković, Approximations of general independent distributions, Proc. 24th Annual ACM Symp Theory of Computing STOC '92, 1992, pp. 10-16; Efficient approximations to probability distributions, Random Struct Alg 13 (1997), 1-16; Efficient approximations of general distributions, //http://theory.lcs.mit.edu/̃oded/eglnv.html, 1997.
17. [EGLNV] G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velicković, Approximations of general independent distributions, Proc. 24th Annual ACM Symp Theory of Computing STOC '92, 1992, pp. 10-16; Efficient approximations to probability distributions, Random Struct Alg 13 (1997), 1-16; Efficient approximations of general distributions, //http://theory.lcs.mit.edu/̃oded/eglnv.html, 1997.
18. O. Goldreich, Three XOR-lemmas - An exposition, Electronic Colloquium on Computational Complexity (ECCC), TR 95-056, 1995.
19. J. Håstad, S. Phillips, and S. Safra, A well characterized approximation problem, Inform Process Lett, 47 (1993), 301-305.
20. H. Karloff and Y. Mansour, On construction of k-wise independent random variables, Proc 24th Annual Symp Theory of Computing STOC '94, 1994, pp. 564-573.
21. R. M. Karp and A. Wigderson, A fast parallel algorithm for the maximal independent set problem, J ACM, 32 (1985), 762-773.
22. M. Krause and P. Pudlak, On the computational power of depth 2 circuits with threshold modulo gates, Proc 26th Annual ACM Symp Theory of Computing STOC '94, 1994, pp. 48-57.
23. C.-H. Lu, Improved pseudorandom generators for combinatorial rectangles, in Proc 25th International Colloquium on Automata, Languages and Programming ICALP '98, LNCS 1443, K. G. Larsen, S. Skyum, and G. Winskel (Editors), Springer-Verlag, Berlin, 1998, pp. 223-234.
24. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988), 261-277.
25. R. Motwani, J. Naor, and M. Naor, The probabilistic method yields deterministic parallel algorithms, J of Comput System Sci, 49 (1994), 478-516.
26. J. Naor and M. Naor, Small bias probability spaces: efficient constructions and applications, SIAM J Comput, 22 (1993), 838-856.
27. M. Naor, L.J. Schulman, and A. Srinivasan, Splitters and near-optimal derandomization, Proc, 36th Annual Symp Foundations of Computer Science, 1995, pp. 182-191.
28. R. Peralta, On the randomness complexity of algorithms, CS Research Report TR 90-1, University of Wiskonsin, Milwaukee, 1990.
29. U. Vazirani, Randomness, adversaries and computation, Ph.D. thesis, University of California, Berkeley, 1986.