Tolerant versus intolerant testing for boolean properties

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 135-140

  Fischer, Eldar ^a   Fortnow, Lance ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (STANDARDS); PROBABILITY;

HADAMARD CODES; LONG CODES; PROBABILISTICALLY CHECKABLE PROOFS OF PROXIMITY; PROPERTY TESTER;

BOOLEAN FUNCTIONS;

EID: 27644500035     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000), 451-476.
2. N. Alon, M. Krivelevich, I. Newman and M. Szegedy, Regular languages are testable with a constant number of queries, SIAM Journal on Computing 30 (2001), 1842-1862.
3. rd International Workshop on Randomization and Approximation Techniques in Computer Science (1999), 246-256.
4. M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs, and nonapproximability - towards tight results, SIAM Journal on Computing 27 (1998), 804-915.
5. th ACM STOC (2004), 1-10.
6. th STOC, 2003).
7. nd STOC, 1990).
8. th ACM-SIAM SODA (2003), 480-488.
9. F. Ergün, S. Kannan, R. Kumar, R. Rubinfeld and M. Viswanathan, Spot checkers, Journal of Computer and System Science 60 (2000), 717-751.
10. st ACM STOC (1999), 41-50.
11. E. Fischer, The art of uninformed decisions: A primer to property testing, The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.
12. rd FOCS special issue) 68 (2004), 753-787.
13. th ACM STOC (2005), to appear.
14. E. Fischer, I. Newman and J. Sgall, Functions that have read-twice constant width branching programs are not necessarily testable, Random Structures and Algorithms 24 (2004), 175-193.
15. th FOCS, 1996).
16. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, Random Structures and Algorithms 23 (2003), 23-57.
17. J. Håstad, Some optimal inapproximability results, Journal of the ACM 48 (2001), 798-859.
18. M. Parnas, D. Ron, and R. Rubinfeld, Tolerant property testing and distance approximation, manuscript (available as ECCC TR04-010).
19. M. Parnas, D. Ron, and A. Samorodnitsky, Testing basic Boolean formulae, SIAM Journal on Discrete Mathematics, 16 (2002), 20-46.
20. D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (edited by S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim), Kluwer Press (2001), Vol. II Chapter 15.
21. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing 25 (1996), 252-271 (first appeared as a technical report, Cornell University, 1993).