Browse Teach Curate

Special Covering of a Set Equivalent to Boolean Satisfiability

A newly defined special covering of the clause set of a CNF formula whose existence is proved polynomially equivalent to Boolean satisfiability, so deciding whether a special covering exists is NP-complete.

K-9 Text

Special Coverings of Sets and Boolean Functions

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study …