Property testing and the branching program size of boolean functions

Lecture Notes in Computer Science

Volumn 3623, Issue , 2005, Pages 258-269

  Bollig, Beate ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; DECISION THEORY;

BRANCHING PROGRAMS; DECISION PROBLEMS; QUERY COMPLEXITY;

BOOLEAN ALGEBRA;

EID: 26844557390     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11537311_23     Document Type: Conference Paper

References (19)

1. Alon, N., Fischer, E., Krivelevich, M., and Szegedy, M. (2000). Efficient testing of large graphs. Combinatorica 20, 451-476.
2. Alon, N., Krivelevich, M., Newman, I., and Szegedy, M. (2000). Regular languages are testable with a constant number of queries. SIAM Journal on Computing 30, 1842-1862.
3. Alon, N. and Shapira, A. (2005). Every monotone graph property is testable. To appear in Proc. of 37th STOC.
4. Ben-Sasson, E., Harsha, P., and Raskhodnikova, S. (2003). Some 3CNF properties are hard to test. Proc. of 35th STOC, 345-354.
5. Bogdanov, A., Obata, K., and Trevisan, L. (2002). A lower bound for testing 3-colorability in bounded-degree graphs. Proc. of 43rd FOCS, 93-102.
6. Bollig, B. and Wegener, I. (2003). Functions that have read-once branching programs of quadratic size are not necessarily testable. Information Processing Letters 87, 25-29.
7. Fischer, E. (2001). The art of uninformed decisions: a primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75 (Oct. 2001), 97-126. The Computational Complexity Column.
8. Fischer, E. (2004). On the strength of comparisons in property testing. Information and Computation 189, 107-116.
9. Fischer, E. (2004a). The difficulty of testing for isomorphism against a graph that is given in advance. Proc. of 36th STOC, 391-397.
10. Fischer, E., Lehman, E., Newman, I., Reskhodnikova, S., Rubinfeld, R., and Samorodnitsky (2002). Monotonicity testing over general poset domains. Proc. of 34th STOC, 73-79.
11. Fischer, E. and Newman, I. (2001). Testing of matrix properties. Proc. of 33rd STOC, 286-295.
12. Fischer, E. and Newman, I. (2005). Testing versus estimation of graph properties. To appear in Proc. of 37th STOC.
13. Fischer, E., Newman, I., and Sgall, J. (2004). Functions that have read-twice constant width branching programs are not necessarily testable. Random Structures and Algorithms 24(2), 175-193.
14. Goldreich, O., Goldwasser, S., and Ron, D. (1998). Property testing and its connection to learning and approximation. Journal of the ACM 45, 653-750.
15. Newman, I. (2002). Testing membership in languages that have small width branching programs. SIAM Journal of Computing 31(5), 1557-1570.
16. Newman, I. (2002a). Private communication.
17. Ron, D. (2001). Property testing (a tutorial). In Handbook of Randomized Computing, Rajasekaran, S., Pardalos, P.M., Reif, J.H., and Rolim, J.D., Eds., vol. 9 of Combinatorial Optimization, Kluwer Academic Publishers, 597-649.
18. Rubinfeld, R. and Sudan, M. (1996). Robust characterization of polynomials with applications to program testing. SIAM Journal of Computing 25(2), 252-271.
19. Yao, A. C. (1977). Probabilistic computation, towards a unified measure of complexity. Proc. of 18th FOCS, 222-227.