Testing basic boolean formulae

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 1, 2003, Pages 20-46

  Parnas, Michal ^a   Ron, Dana ^b   Samorodnitsky, Alex ^c  

^a ACADEMIC COLLEGE OF TEL AVIV YAFFO   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximation algorithms; Boolean functions; Property testing; Randomized algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

PROPERTY TESTING; RANDOMIZED ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 0037285627     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480101407444     Document Type: Article

References (21)

1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, NY, 1999, pp. 645-655.
2. D. Angluin, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
3. Y. Aumann, Y. Håstad, M. Rabin, and M. Sudan, Linear consistency testing, in Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, 1999, Springer-Verlag, Berlin, 1999, pp. 109-120.
4. M. Bellare, D. Coppersmith, J. Håstad, M. Kiwi, and M. Sudan, Linearity testing in characteristic two, in Proceedings of the 36th Annual Symposium on Foundations of Computer Science, Milwaukee, WI, 1995, IEEE Computer Society Press, 1995, pp. 432-441.
5. M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and nonapproximability-Towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
6. M. Blum, M. Luby, and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, J. Comput. System. Sci., 47 (1993), pp. 549-595.
7. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Occam's razor, Inform. Process. Lett., 24 (1987), pp. 377-380.
8. N. Bshouty, J. Jackson, and C. Tamon, More efficient PAC-learning of DNF with membership queries under the uniform distribution, in Proceedings of the Twelfth Annual Conference on Computational Learning, Santa Cruz, CA, 1999, pp. 286-295.
9. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. SAmorodnitsky, Improved testing algorithms for monotonocity, in Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, 1999, Springer-Verlag, Berlin, 1999, pp. 97-108.
10. E. Fischer, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
11. E. Fischer, G. Kindler, D. Ron, S. Safra, and A. SAmorodnitsky, Testing juntas, in Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002, to appear.
12. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing monotonicity, Combinatorica, 20 (2000), pp. 301-337.
13. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
14. O. Goldreich and D. Ron, Property testing in bounded degree graphs, in Algorithmica, 32 (2002), pp. 302-343.
15. J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, J. Comput. System Sci., 55 (1997), pp. 414-440.
16. A. Klivans and R. Servedio, Boosting and hard-core sets, in Proceedings of the 40th Annual Symposium on Foundations of Computer Science, New York, NY, 1999, pp. 624-633.
17. M. Parnas, D. Ron, and A. Samorodnitsky, Proclaiming dictators and juntas or testing boolean formulae, in Proceedings of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, Berkeley, CA, 2001, pp. 273-284.
18. M. Parnas, D. Ron, and A. Samorodnitsky, Testing Boolean Formulae, http://www.eccc.uni-trier.de/eccc/, TR01-063, 2001.
19. D. Ron, Property testing, in Handbook of Randomized Computing, Volume II, S. Rajasekaran, P. Pardalos, J. Reif, and J. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
20. R. Rubinfeld, On the robustness of functional equations, SIAM J. Comput., 28 (1999), pp. 1972-1997.
21. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.