Normal forms for Boolean formulas

[84/99%]

Subtopics

Perfect (canonical) DNF and CNF[28/100%]
Zhegalkin (algebraic normal form) polynomials[22/100%]
Constructing and converting between DNF and CNF[15/100%]
Detecting function properties from a normal form[10/100%]
Minimization of DNF (implicants, reduced and minimal DNF)[8/100%]
Complexity of converting between DNF and CNF[1/0%]