Title :
Functions that have read-twice constant width branching programs are not necessarily testable
Author :
Fischer, Eldar ; Newman, Ilan
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fDate :
6/24/1905 12:00:00 AM
Abstract :
We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided ε-testing algorithm must make at least Ω(n1/10) many queries for some fixed small enough ε. This shows that Newman´s result (2000) cannot be generalized to read-k-times functions for k > 1
Keywords :
Boolean functions; binary decision diagrams; computational complexity; directed graphs; Boolean functions; complexity; directed graph; read-k-times functions; read-twice constant width branching programs; strings; testing algorithm; Adaptive algorithm; Approximation algorithms; Binary decision diagrams; Boolean functions; Computational complexity; Computer science; Hamming distance; National electric code; Testing;
Conference_Titel :
Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Conference_Location :
Montreal, Que.
Print_ISBN :
0-7695-1468-5
DOI :
10.1109/CCC.2002.1004342
