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

Dana Ron, Gilad Tsur

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 7th International Conference, CIAC 2010, Proceedings
Number of pages12
StatePublished - 2010
Event7th International Conference on Algorithms and Complexity, CIAC-2010 - Rome, Italy
Duration: 26 May 201028 May 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6078 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Conference on Algorithms and Complexity, CIAC-2010


Dive into the research topics of 'Testing computability by width-2 OBDDs where the variable order is unknown'. Together they form a unique fingerprint.

Cite this