Approximation of boolean functions by combinatorial rectangles
Theoretical Computer Science
| Hi-index | 0.00 |
Abstract: Branching programs are considered as a nonuniform model of computation in complexity theory as well as a data structure for boolean functions in several applications. In many applications (e.g., verification), exact representations are required. For learning boolean functions f on the basis of classified examples, it is sufficient to produce the representation of a function g approximating f. This motivates the investigation of the size of the smallest branching program approximating f. Although several non-approximability results are contained in the papers on randomized branching programs, these results often do not work for the uniform distribution (which is the most important one in applications). Here, the following non-approximability results are presented. (1) It is proven that a simple functions from the branching program literature requires exponential size to be approximated with respect to the uniform distribution by OBDDs, which are the most important type of branching programs in applications. (2) The first truly exponential lower bound on the size of approximating syntactic read-k-times branching programs with respect to the uniform distribution and error probability 1 /2 -2^{\Omega(n)}, n the input size, is shown. In order to improve upon the so far best results for error probabilities smaller than 1/3 , a strong combinatorial lemma from a recent paper of Ajtai on linear-length branching programs is exploited.