Testing juntas

Journal of Computer and System Sciences

Volumn 68, Issue 4, 2004, Pages 753-787

  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

Boolean functions; Discrete Fourier Analysis; Juntas; Property testing

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; FOURIER TRANSFORMS; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; RANDOM PROCESSES;

DISCRETE FOURIER ANALYSIS; JUNTAS; PROPERTY TESTING; RANDOM WALK;

COMPUTER SCIENCE;

EID: 3042662710     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.11.004     Document Type: Conference Paper

References (23)

1. Aldous D., Diaconis P. Shuffling cards and stopping times. Amer. Math. Monthly. 93(5):1986;333-348.
2. N. Alon, J.H. Spencer, The Probabilistic Method, Wiley-Interscience (Wiley), New York, 1992 (1st Edition) 2000 (2nd Edition).
3. Arora S., Lund C., Motwani R., Sudan M., Szegedy M. Proof verification and the hardness of approximation problems. J. ACM. 45(3):1998;501-555.
4. Arora S., Safra S. Probabilistic checking of proofs. a new characterization of NP J. ACM. 45(1):1998;70-122.
5. Ben-Or M., Linial N. Collective coin flipping. ADVCR: Adv. Comput. Res. 5:1989;91-116.
6. Blum A., Hellerstein L., Littlestone N. Learning in the presence of finitely or infinitely many irrelevant attributes. J. Comput. System Sci. 50(1):1995;32-40.
7. H. Chockler, D. Gutfreund, Property testing: worst case vs. average case, manuscript, 2002.
8. I. Dinur, E. Fischer, G. Kindler, R. Raz, S. Safra, PCP characterizations of NP: towards a polynomially-small error-probability, in: Proceedings of the 31st ACM Symposium on Theory of Computing, Atlanta, GA, 1999.
9. I. Dinur, S. Safra, On the importance of being biased, in: Proceedings of the 34th ACM Symposium on Theory of Computing, Montreal, QC, Canada, 2002.
10. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, A. Samorodnitsky, Improved testing algorithms for monotonicity, Third International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Berkeley, CA, August 1999.
11. Fischer E. The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. Theoret. Comput. Sci. 75:2001;97-126.
12. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, in: Proceedings of the 34th ACM Symposium on Theory of Computing, Montreal, QC, Canada, 2002, pp. 474-483.
13. Goldreich O., Goldwasser S., Lehman E., Ron D., Samorodnitsky A. Testing monotonicity. Combinatorica. 20(3):2000;301-337.
14. Goldwasser S., Goldreich O., Ron D. Property testing and its connections to learning and approximation. J. ACM. 45(4):1998;653-750.
15. D. Guijarro, J. Tarui, T. Tsukiji, Finding relevant variables in PAC model with membership queries, in: O. Watanabe, T. Yokomori, (Eds.), Proceedings of the Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 1999, Lecture Notes in Artificial Intelligence, Vol. 1720, Springer, Berlin, 1999, pp. 313-322.
16. Littlestone N. Learning quickly when irrelevant attributes abound. a new linear-threshold algorithm Mach. Learning. 2:1987;285.
17. Markov A.A. Extension of the law of large numbers to dependent events. Bull. Soc. Phys. Math. 15(2):1906;135-156.
18. E. Mossel, R. O'Donnell, R.A. Servedio, Learning juntas, Proceedings of the 35th Annual Symposium on the Theory of Computing (STOC), San Diego, CA, 2003, pp. 206-212.
19. Parnas M., Ron D., Samorodnitsky A. Testing basic boolean formulae. SIAM J. Discrete Math. 16(1):2002;20-46.
20. R. Raz, S. Safra, A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP, in: Proceedings of the 29th ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 475-484.
21. D. Ron, Property testing, in: S. Rajasekaran, P.M. Pardalos, J.H. Reif, J. Rolim (Eds.), Handbook on Randomization, Vol. II, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
22. Rubinfeld R., Sudan M. Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2):1996;252-271.
23. R. Uehara, K. Tsuchida, I. Wegener, Optimal attribute-efficient learning of disjunction, parity and threshold functions, in: S.B. David (Ed.), Proceedings of the third European Conference on Computational Learning Theory, Berlin, March 17-19 1997, Lecture Notes in Artificial Intelligence, Vol. 1208, Springer, Berlin, pp. 171-184.