Simple disjunctive normal forms of Boolean functions with a restricted number of zeros

From MaRDI portal





From the introduction: ``This paper studies the complexity of disjunctive normal forms (DNFs) of Boolean functions defined by their matrices of zeros. The best available bounds are obtained for the minimum number of conjunctions making up a DNF of a Boolean function with a restricted number of zeros. The results can be used to implement characteristic functions of classes in patterns with binary data.











This page was built for publication: Simple disjunctive normal forms of Boolean functions with a restricted number of zeros

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761058)