Abstract

This paper deals with the number of monochromatic combinatorial rectangles required to approximate a boolean function on a constant fraction of all inputs, where each rectangle may use its own partition of the input variables. The main result of the paper is that the number of rectangles required for the approximation of boolean functions in this model is very sensitive to the allowed error. There is an explicitly defined sequence of boolean functions f_n on n variables such that f_n has rectangle approximations with a constant number of rectangles and one-sided error or two-sided error , but, on the other hand, f_n requires exponentially many rectangles if the error bounds are decreased by an arbitrarily small constant.

As applications of this result, the following separation results for read-once branching programs are obtained. The functions from the main result require only linear size for nondeterministic read-once branching programs and randomized read-once branching programs with two-sided error , while randomized read-once branching programs with constant two-sided error smaller than and unambiguous nondeterministic read-once branching programs require exponential size.

Author Keywords: Branching programs; Communication complexity; Lower bounds; Approximation; Nondeterminism; Randomness