Approximation of boolean functions by co
β
Martin Sauerhoff
π
Article
π
2003
π
Elsevier Science
π
English
β 388 KB
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 fo