Projective cofactor decompositions of Boolean functions and the satisfiability problem

Madhav Desai, Virendra Sule

Given a CNF formula $F$, we present a new algorithm for deciding the satisfiability (SAT) of $F$ and computing all solutions of assignments. The algorithm is based on the concept o…