Irreducible Conjunctive Normal Forms of the Zero Function II
MATHEMATICS AND EDUCATION IN MATHEMATICS, Sofia, 1997, pp 209-215, (Proceedings of the Twenty-Sixth Spring Conference of the Union of Bulgarian Mathematicians, Plovdiv, April 22 –25, 1997),
In connection with the NP-completeness of problems, a set of conjunctive
normal forms of the zero function are considered in this paper --
those, any disjunct of which has no more than three literals
(3-CNForms). Some equivalencies between the conjunctive normal forms
are defined and the 3-CNForms of the zero function, comprising up to three variables, are classified under defined equivalences.
Boolean function, zero constant, SAT, 3-SAT, conjunctive normal form, equivalence, classification