Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
On learning bounded-width branching programs
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
On learning width two branching programs
Information Processing Letters
Query learning of bounded-width OBDDs
Theoretical Computer Science - Special issue on algorithmic learning theory
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs
SIAM Journal on Computing
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics
On Learning Programs and Small Depth Circuits
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Learning Ordered Binary Decision Diagrams
ALT '95 Proceedings of the 6th International Conference on Algorithmic Learning Theory
Testing Computability by Width Two OBDDs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
An efficient query learning algorithm for ordered binary decision diagrams
Information and Computation
On testing computability by small width OBDDs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for testing computability by small width OBDDs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Testing computability by width-two OBDDs
Theoretical Computer Science
Hi-index | 0.00 |
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 $\tilde{O}({\rm log n}){\rm poly}(1/\epsilon)$. 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.