a disjunctive normal form (dnf) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products.
a dnf is a -dnf if each of its terms has at most literals. [cite:;taken from @complexity_jukna_2012 chapter 1 our adversary: the circuit]
-dnf if each of its