Approximating Boolean Functions with Disjunctive Normal Form

The theorem states that: Every Boolean function can be $ε-approximated$ by a Disjunctive Normal Form (DNF) of size $O_ε(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is generated and proving its correctness. We will also dive into some specific Boolean functions and explore how these Boolean functions can be approximated by a DNF whose size is within the universal bound $O_ε(2^{n}/\log{n})$. The Boolean functions we interested in are: Parity Function: the parity function can be $ε-approximated$ by a DNF of width $(1 - 2ε)n$ and size $2^{(1 - 2ε)n}$. Furthermore, we will explore the lower bounds on the DNF's size and width. Majority Function: for every constant $1/2 < ε< 1$, there is a DNF of size $2^{O(\sqrt{n})}$ that can $ε-approximated$ the Majority Function on n bits. Monotone Functions: every monotone function f can be $ε-approximated$ by a DNF g of size $2^{n - Ωε(n)}$ satisfying $g(x) \le f(x)$ for all x.

No reviews yet.

No comments yet.