TY - GEN

T1 - Testing computability by width-2 OBDDs where the variable order is unknown

AU - Ron, Dana

AU - Tsur, Gilad

N1 - Funding Information:
★ This work was supported by the Israel Science Foundation (grant number 246/08).

PY - 2010

Y1 - 2010

N2 - Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is "far" (for a prespecified distance measure) from every object with that property. In this work we design and analyze an algorithm for testing functions for the property of being computable by a read-once width-2 Ordered Binary Decision Diagram (OBDD), also known as a branching program, where the order of the variables is not known to us. That is, we must accept a function f if there exists an order of the variables according to which a width-2 OBDD can compute f. The query complexity of our algorithm is . In previous work (in Proceedings of RANDOM, 2009) we designed an algorithm for testing computability by an OBDD with a fixed order, which is known to the algorithm. Thus, we extend our knowledge concerning testing of functions that are characterized by their computability using simple computation devices and in the process gain some insight concerning these devices.

AB - Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is "far" (for a prespecified distance measure) from every object with that property. In this work we design and analyze an algorithm for testing functions for the property of being computable by a read-once width-2 Ordered Binary Decision Diagram (OBDD), also known as a branching program, where the order of the variables is not known to us. That is, we must accept a function f if there exists an order of the variables according to which a width-2 OBDD can compute f. The query complexity of our algorithm is . In previous work (in Proceedings of RANDOM, 2009) we designed an algorithm for testing computability by an OBDD with a fixed order, which is known to the algorithm. Thus, we extend our knowledge concerning testing of functions that are characterized by their computability using simple computation devices and in the process gain some insight concerning these devices.

UR - http://www.scopus.com/inward/record.url?scp=77953762808&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13073-1_13

DO - 10.1007/978-3-642-13073-1_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77953762808

SN - 3642130720

SN - 9783642130724

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 131

EP - 142

BT - Algorithms and Complexity - 7th International Conference, CIAC 2010, Proceedings

Y2 - 26 May 2010 through 28 May 2010

ER -