On the randomness complexity of property testing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4627 LNCS, Issue , 2007, Pages 509-524

  Goldreich, Oded ^a   Sheffet, Or ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; QUERY PROCESSING; RANDOM PROCESSES;

PROPERTY TESTING; RANDOMNESS COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 38049021715     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74208-1_37     Document Type: Conference Paper

References (21)

1. Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of Clustering. SIDMA 16(3), 393-417 (2003)
2. Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. In: 40th FOCS, 1999, pp. 645-655 (1999)
3. Alon, N., Fischer, E., Newman, I., Shapira, A.: A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity. In: 38th STOC, 2006, pp. 251-260 (2006)
4. Alon, N., Krivelevich, M.: Testing k-Colorability. SIDMA 15(2), 211-227 (2002)
5. Ben-Sasson, E., Sudan, M., Vadhan, S., Wigderson, A.: Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In: Proc. 35th STOC, pp. 612-621 (June 2003)
6. Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. JCSS 47, 549-595 (1993)
7. Canetti, R., Even, G., Goldreich, O.: Lower Bounds for Sampling Algorithms for Estimating the Average. IPL 53, 17-25 (1995)
8. Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the EATCS 75, 97-126 (2001)
9. Goldreich, O.: Another motivation for reducing the randomness complexity of algorithms. Position paper. ECCC (2006)
10. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. JACM, 653-750 (July 1998)
11. Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing Monotonicity. Combinatorica 20(3), 301-337 (2000)
12. Goldreich, O., Ron, D.: Property testing in bounded degree graphs. Algorithmica, 302-343 (2002)
13. Goldreich, O., Ron, D.: A sublinear bipartite tester for bounded degree graphs. Combinatorica 19(3), 335-373 (1999)
14. Goldreich, O., Sudan, M.: Locally testable codes and PCPs of almost linear length. JACM 53(4), 558-655 (2006)
15. Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Structures and Algorithms 23(1), 23-57 (2003)
16. Lovász, L., Young, N.: Lecture Notes on Evasiveness of Graph Properties. In: TR-317-91, Computer Science Dept. Princeton University (1991)
17. Ron, D.: Property testing. In: Handbook on Randomization, pp. 597-649 (2001)
18. Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SICOMP 25(2), 252-271 (1996)
19. Shaltiel, R.: Recent Developments in Explicit Constructions of Extractors. Bulletin of the EATCS 77, 67-95 (2002)
20. Sheffet, O.: Reducing the Randomness Complexity of Property Testing, with an Emphasis on Testing Bipartiteness. M.Sc. Thesis, Weizmann Institute of Science (December 2006) Available from http://www.wisdom.weizmann.ac.il/~oded/ p_ors.html
21. Shpilka, A., Wigderson, A.: Derandomizing Homomorphism Testing in General Groups. SICOMP, Vol. 36-4, pp.1215-1230, 2006