Variants An important variation used in the study of computational complexity is k-DNF. A formula is in k-DNF if it is in DNF and each conjunction contains at most k literals. See also Algebraic normal form – an XOR of AND clauses Blake canonical form – DNF including all prime implicants Quine–McCluskey algorithm – algorithm for calculating prime implicants Propositional logic Truth table Notes References External links Normal forms (logic)