Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1997: STACS 97 pp 141–152Cite as

MODp-tests, almost independence and small probability spaces

Extended abstract

  • Probabilism
  • Conference paper
  • First Online:

  • 110 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1200))

Abstract

We consider approximations of probability distributions over ℤ n p . We present an approach to estimate the quality of approximations towards the construction of small probability spaces which are used to derandomize algorithms. In contrast to results by Even et al. [13], our methods are simple, and for reasonably small p, we get smaller sample spaces. Our considerations are motivated by a problem which was mentioned in recent work of Azar et al. [5], namely, how to construct in time polynomial in n a good approximation to the joint probability distribution of i.i.d. random variables X 1,...,X n where each X i has values in {0,1}. Our considerations improve on results in [5].

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, L. Babai and A. Itai, A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem, J. Alg. 7, 1985, 567–583.

    Google Scholar 

  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. Inf. Th. 38, 1992, 509–516.

    Article  Google Scholar 

  3. N. Alon, O. Goldreich, J. Håstad and R. Peralta, Simple Constructions of Almost k-wise Independent Random Variables, Random Structures & Algorithms 3, 1992, 289–304. Addendum: Random Structures & Algorithms 4, 1993, 119–120.

    Google Scholar 

  4. N. Alon and J. Spencer, The Probabilistic Method, Wiley & Sons, New York, 1992.

    Google Scholar 

  5. Y. Azar, R. Motwani and J. Naor, Approximating Probability Distributions using Small Sample Spaces, preprint, 1995.

    Google Scholar 

  6. L. Babai, P. Frankl and J. Simon, Complexity Classes in Communication Complexity Theory, Proc. 27th FOCS, 1986, 337–347.

    Google Scholar 

  7. J. Beck and W. Chen, Irregularities of Distribution, Cambridge Univ. Press, 1987.

    Google Scholar 

  8. B. Berger and J. Rompel, Simulating (log n)c-wise Independence in NC, J. ACM 38, 1991, 1026–1046.

    Article  Google Scholar 

  9. C. Bertram-Kretzberg, TH-MOD p -circuits, preprint, 1996.

    Google Scholar 

  10. S. Chari, P. Rohatgi and A. Srinivasan, Improved Algorithms via Approximations of Probability Distributions, Proc. 26th STOC, 1996, 584–592.

    Google Scholar 

  11. F. R. K. Chung, R. L. Graham and R. M. Wilson, Quasi-Random Graphs, Combinatorica 9, 1989, 345–362.

    Article  Google Scholar 

  12. G. Even, Construction of Small Probability Spaces for Deterministic Simulation, M. Sc. thesis, Technion, Haifa, Israel, 1991.

    Google Scholar 

  13. G. Even, O. Goldreich, M. Luby, N. Nisan and B. Veličković, Approximations of General Independent Distributions, Proc. 24th STOC, 1992, 10–16.

    Google Scholar 

  14. J. Håstad, S. Phillips and S. Safra, A Well Characterized Approximation Problem, Inf. Proc. Lett. 47, 1993, 301–305.

    Article  Google Scholar 

  15. H. Karloff and Y. Mansour, On Construction of k-wise Independent Random Variables, Proc. 24th STOC, 1994, 564–573.

    Google Scholar 

  16. M. Krause and P. Pudlák, On the Computational Power of Depth-2 Circuits with Threshold Modulo Gates, Proc. 26th STOC, 1994, 48–57.

    Google Scholar 

  17. A. Lubotzky, R. Phillips and P. Sarnak, Ramanujan Graphs, Combinatorica 8, 1988, 261–277.

    Article  Google Scholar 

  18. R. Motwani, J. Naor and M. Naor, The Probabilistic Method Yields Deterministic Parallel Algorithms, J. Comp. Sys. Sci. 49, 1994, 478–516.

    Article  Google Scholar 

  19. J. Naor and M. Naor, Small Bias Probability Spaces: Efficient Constructions and Applications, SIAM J. Comp. 22, 1993, 838–856.

    Article  Google Scholar 

  20. M. Naor, L. J. Schulman and A. Srinivasan, Splitters and Near-Optimal Derandomization, Proc. 36th FOCS, 1995, 182–191.

    Google Scholar 

  21. R. Peralta, On the Randomness Complexity of Algorithms, CS Research Report TR 90-1, University of Wiskonsin, Milwaukee, 1990.

    Google Scholar 

  22. U. Vazirani, Randomness, Adversaries and Computation, PhD thesis, University of California, Berkeley, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Informatik II, Universität Dortmund, D-44221, Dortmund, Germany

    Claudia Bertram-Kretzberg & Hanno Lefmann

Authors
  1. Claudia Bertram-Kretzberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanno Lefmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rüdiger Reischuk Michel Morvan

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertram-Kretzberg, C., Lefmann, H. (1997). MODp-tests, almost independence and small probability spaces. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023455

Download citation

  • DOI: https://doi.org/10.1007/BFb0023455

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62616-9

  • Online ISBN: 978-3-540-68342-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation