A lower bound for testing juntas

Information Processing Letters

Volumn 90, Issue 6, 2004, Pages 301-305

  Chockler, Hana ^a   Gutfreund, Dan ^b  

^a NORTHEASTERN UNIVERSITY   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Boolean functions; Computational complexity; Property testing; Randomized algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; INFORMATION SCIENCE; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; QUERY LANGUAGES; RANDOM PROCESSES; THEOREM PROVING;

PROPERTY TESTING; QUERY COMPLEXITY; RANDOM FUNCTIONS; RANDOMIZED ALGORITHMS;

BOOLEAN FUNCTIONS;

EID: 2442542636     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.01.023     Document Type: Article

References (13)

1. Alon N., Krivelevich M. Testing k-colorability. SIAM J. Discrete Math. 15:2002;211-227.
2. Alon N., Krivelevich M., Newman I., Szegedy M. Regular languages are testable with a constant number of queries. Proc. 40th FOCS. 1999;645-655.
3. Blum M., Luby M., Rubinfeld R. Self-testing/correcting with applications to numerical problems. J. Comput. System Sci. 47:1993;549-595.
4. Bender M.A., Ron D. Testing acyclicity of directed graphs in sublinear time. Proc. 27th ICALP. 2000.
5. Fischer E., Kindler G., Ron D., Safra S., Samorodnitsky A. Testing juntas. 43rd FOCS. 2002;103-112 IEEE Computer Society.
6. Goldreich O., Goldwasser S., Lehman E., Ron D., Samorodnitsky A. Testing monotonicity. Combinatorica. 20:(3):2000;301-337.
7. Goldreich O., Goldwasser S., Ron D. Property testing and its connection to learning and approximation. J. ACM. 45:(4):1998;653-750.
8. Goldreich O., Ron D. Property testing in bounded degree graphs. Proc. 25th STOC. 1997;406-415.
9. Goldreich O., Ron D. A sublinear bipartite tester for bounded degree graphs. Combinatorica. 19:(3):1999;335-373.
10. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, New York.
11. Parnas M., Ron D., Rubinfeld R. Testing parenthesis languages. Proc. 5th International Workshop on Randomization and Approximation Techniques in Computer Science. 2001;261-272.
12. Parnas M., Ron D., Samorodnitsky A. Proclaiming dictators and juntas or testing boolean formulae. Proc. 5th RANDOM. 2001;273-284.
13. Rubinfeld R., Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25:(2):1996;252-271.