Testing monotone high-dimensional distributions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 147-156

  Rubinfeld, Ronitt ^a   Servedio, Rocco A ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Columbia University ^*  (United States)

Author keywords

Distribution testing; Monotone distributions; Property testing; Sublinear algorithms

Indexed keywords

DISTRIBUTION TESTING; MONOTONE DISTRIBUTIONS; PROPERTY TESTING; SUBLINEAR ALGORITHMS;

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

PROBABILITY DISTRIBUTIONS;

EID: 34848918895     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060613     Document Type: Conference Paper

References (12)

1. D. Aldous. On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in Engineering and Information Sciences, 1:33-46, 1987.
2. T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, and P. White. Testing random variables for independence and identity. In IEEE Symposium on Foundations of Computer Science, pages 442-451, 2001.
3. Tugkan Batu, Sanjoy Dasgupta, Ravi Kumar, and Ronitt Rubinfeld. The complexity of approximating entropy. In ACM Symposium on Theory of Computing, pages 678-687, 2002.
4. Tugkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, and Patrick White. Testing that distributions are close. In IEEE Symposium on Foundations of Computer Science, pages 259-269, 2000.
5. Tugkan Batu, Ravi Kumar, and Ronitt Rubinfeld. Sublinear algorithms for testing monotone and unimodal distributions. In ACM Symposium on Theory of Computing, pages 381-390, 2004.
6. o functions. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 317-325, 1991.
7. O. Goldreich and D. Ron. On testing expansion in bounded-degree graphs. Electronic Colleqium on Computational Complexity, 7(20), 2000.
8. W. C. Huffman and V. Pless. Fundamentals of Error Correcting Codes, Cambridge University Press, 2003.
9. M. Kearns and U. Vazirani. An introduction to computational learning theory. MIT Press, Cambridge, MA, 1994.
10. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform and learnability. J. ACM, 40(3):607-620, 1993.
11. R. Servedio. On learning monotone DNF under product distributions. In Proc. 14th ACM Conference on Computational Learning Theory, pages 473-489, 2001.
12. A. Yao. Probabilistic computations: Towards a unified measure of complexity. In Symposium on Foundations of Computer Science, pages 222-227, 1977.