Results 1 
2 of
2
Testing Computability by WidthTwo OBDDs Where the Variable Order is Unknown
"... 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 c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
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 readonce width2 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 width2 OBDD can compute f. The query complexity of our algorithm is Õ(log n)poly(1/ɛ). 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. 1
Exponentially
"... improved algorithms and lower bounds for testing signed majorities ..."
(Show Context)