# 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/logn). 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/logn). 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(√(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) ≤ f(x) for all x.

research
01/30/2021

### Size and Depth Separation in Approximating Natural Functions with Neural Networks

When studying the expressive power of neural networks, a main challenge ...
research
04/22/2019

### Almost Optimal Testers for Concise Representations

We give improved and almost optimal testers for several classes of Boole...
research
01/25/2019

### A structure theorem for almost low-degree functions on the slice

The Fourier-Walsh expansion of a Boolean function f {0,1}^n →{0,1} is it...
research
10/19/2018

### Parity Decision Tree Complexity is Greater Than Granularity

We prove a new lower bound on the parity decision tree complexity D_⊕(f)...
research
09/27/2021

### On the power of choice for Boolean functions

In this paper we consider a variant of the well-known Achlioptas process...
research
04/14/2019

### Approximating the noise sensitivity of a monotone Boolean function

The noise sensitivity of a Boolean function f: {0,1}^n →{0,1} is one of ...
research
05/11/2020

### Monotone Boolean Functions, Feasibility/Infeasibility, LP-type problems and MaxCon

This paper outlines connections between Monotone Boolean Functions, LP-T...