3 problems

Let $w$ be a positive integer, let $\varepsilon>0$, and let a monotone width-$w$ DNF be a monotone DNF whose terms contain at most $w$ literals. An upper-bound DNF for $f$ satisfie…

A monotone DNF is a DNF containing no negated literals. In the improved upper-bound DNF compression conjecture, $f_{\mathrm{upper}}$ is an upper bound of $f$ when…

A DNF is a disjunction of conjunctive terms; its width is the maximum number of literals in a term, its size is its number of terms, and two Boolean functions are $\varepsilon$-clo…