Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable

Authors:
Eldar Fischer;Ilan Newman
Affiliations:
-;-
Venue:
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Year:
2002

Citing 0
Cited 4

Monotonicity testing over general poset domains

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Some 3CNF properties are hard to test

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Functions that have read-once branching programs of quadratic size are not necessarily testable

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

Random Structures & Algorithms

Quantified Score

Hi-index	0.00

Visualization

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 \varepsilon testing algorithm must make at least \Omega (n^{{1 \over {10}}}) many queries for some fixed small enough \varepsilon This shows that Newman's result [15] cannot be generalized to read-k times functions for k 1