Functions that have read-once branching programs of quadratic size are not necessarily testable

Information Processing Letters

Volumn 87, Issue 1, 2003, Pages 25-29

  Bollig, Beate ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Binary decision diagrams; Branching programs; Computational complexity; Property testing

Indexed keywords

ALGORITHMS; FUNCTIONS; POLYNOMIALS; PROBABILITY;

BINARY DECISION DIAGRAMS;

COMPUTATIONAL COMPLEXITY;

EID: 0038247999     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00230-8     Document Type: Article

References (16)

1. Alon N., Fischer E., Krivelevich M., Szegedy M. Efficient testing of large graphs. Combinatorica. 20:2000;451-476.
2. Alon N., Krivelevich M., Newman I., Szegedy M. Regular languages are testable with a constant number of queries. SIAM J. Comput. 30:2001;1842-1862.
3. Babai L., Pudlák P., Rödl V., Seméredi M. Lower bounds to the complexity of symmetric Boolean functions. Theoret. Comput. Sci. 74:1990;313-323.
4. Bollig B., Wegener I. Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams. Theory Comput. Systems. 32:1999;487-503.
5. Fischer E. Testing graphs for colorability properties. Proc. 12th SODA. 2001;873-882.
6. Fischer E., Newman I. Testing of matrix properties. Proc. 33rd STOC. 2001;286-295.
7. Fischer E., Newman I. Functions that have read-twice constant width branching programs are not necessarily testable. Proc. 17th Computational Complexity. 2002;73-79.
8. Goldreich O., Goldwasser S., Ron D. Property testing and its connection to learning and approximation. Proc. 37th FOCS. 1996;339-348.
9. Goldreich O., Goldwasser S., Ron D. Property testing and its connection to learning and approximation. J. ACM. 45:1998;653-750.
10. Goldreich O., Ron D. Property testing in bounded degree graphs. Proc. 29th STOC. 1997;406-415.
11. Newman I. Testing of functions that have small width branching programs. Proc. 41st FOCS. 2000;251-258.
12. I. Newman, Private communication (2002).
13. Newman I. Testing membership in languages that have small width branching programs. SIAM J. Comput. 31:2002;1557-1570.
14. Parnas M., Ron D. Testing metric properties. Proc. 33rd STOC. 2001;276-285.
15. Rubinfeld R., Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25:(2):1996;252-271.
16. Yao A.C. Probabilistic computation, towards a unified measure of complexity. Proc. 18th FOCS. 1977;222-227.