Functions that have read-twice constant width branching programs are not necessarily testable

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2002, Pages 73-79

  Fischer, Eldar ^a   Newman, Ilan ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (18)

1. Efficient testing of large graphs
2. Regular languages are testable with a constant number of queries
3. Proof verification and the hardness of approximation problems
4. Fast approximate PCPs for multidimensional bin-packing problems
5. Self-testing/correcting with applications to numerical problems
6. Improved testing algorithms for monotonicity
7. Testing graphs for colorability properties
8. The an of uninformed decisions: A primer to property testing
9. Self-testing/correcting for polynomials and for approximate functions
10. Property testing and its connections to learning and approximation
11. Property testing in bounded degree graphs
12. Testing of function that have small width branching programs
13. Property testing (a tutorial)
14. Robust characterization of polynomials with applications to program testing
15. Probabilistic computation, towards a unified measure of complexity