Disjoint DNF Tautologies with Conflict Bound Two
Balázs Szörényi · Journal on Satisfiability Boolean Modeling and Computation · 2007
Many aspects of the relation of different decision tree and DNF complexity measures of Boolean functions have been more or less substantially explored. This paper adds a new detail to the picture: we prove that DNF tautologies with terms conflicting