Testing juntas

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 103-112

  Fischer, Eldar ^a   Kindler, Guy ^b   Ron, Dana ^b   Safra, Shmuel ^b   Samorodnitsky, Alex ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; GRAPH THEORY; HARMONIC ANALYSIS; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SET THEORY;

NONADAPTIVE TEST; QUERY COMPLEXITY; STEP DISTRIBUTION;

FUNCTION EVALUATION;

EID: 0036953609     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. D. Aldous, P. Diaconis, Shuffling cards and stopping times, American Mathematical Monthly, 93(5):333-348, 1986.
2. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley-Interscience, 2000 (second edition).
3. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and the hardness of approximation problems, Journal of the ACM, 45(3):501-555, 1998.
4. S. Arora and S. Safra, Probabilistic checking of proofs: A new characterization of NP, Journal of the ACM, 45(1):70-122, 1998.
5. A. Blum, L. Hellerstein and N. Littlestone, Learning in the presence of finitely or infinitely many irrelevant attributes, Journal of Computer Systems Science, 50(1):32-40, 1995.
6. N. Bshouty and N. Littlestone, Attribute-efficient learning in query and mistake-bound models. Proceedings of the 9st COLT, 235-243, 1996.
7. H. Chockle and D. Gutfreund, Property Testing: Worst Case vs. Average Case, manuscript, 2002.
8. I. Dinur, E. Fischer, G. Kindler, R. Raz and S. Safra, PCP: Approaching a Polynomially-Small Error-Probability, Proceedings of the 31st ACM STOC, 29-40, 1999.
9. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron and A. Samorodnitsky, Improved testing algorithms for monotonicity, Proceedings of the 3rd RANDOM conference, 97-108, 1999.
10. E. Fischer, The art of uninformed decisions: A primer to property testing, The Bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001.
11. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, and A. Samorodnitsky, Monotonicity testing over general poset domains, Proceedings of the 34th ACM STOC, 474-483, 2002.
12. E. Friedgut, Boolean functions with low average sensitivity depend on few coordinates, Combinatorica, 18(1):27-35, 1998.
13. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron and A. Samorodnitsky, Testing monotonicity, Combinatorica, 20(3):301-337, 2000.
14. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connections to learning and approximation, Journal of the ACM, 45(4):653-750, 1998.
15. D. Guijarro, J. Tarui and T. Tsukiji, Finding relevant variables in PAC model with membership queries, Proceedings of the 10th ALT conference, 313-322, 1999.
16. N. Littlestone, Learning quickly when irrelevant attribute abound: A new linear-threshold algorithm, Machine Learning 2:285-318, 1988.
17. A. A. Markov, Extension of the law of large numbers to dependent events, Bull. Soc. Phys. Math., Kazan(2) 15:135-156, 1906.
18. E. Mossel, R. O'Donnell and R. A. Servedio, Learning functions of κ hidden variables, manuscript.
19. M. Parnas, D. Ron and A. Samorodnitsky, Proclaiming dictators and juntas or testing Boolean formulae, Proceedings of the 5th RANDOM conference, 2001. An improved version of this extended abstract will appear in SIAM J. of Discrete Mathematics.
20. D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds), Kluwer Press, 2001.
21. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. of Computing, 25(2):252-271, 1996.
22. R. Uehara, K. Tsuchida and I Wegener, Optimal attribute-efficient learning of disjunctions, parity, and threshold functions, Proceedings of EuroColt, 171-184, 1997.