Polynomial Time Algorithm for Boolean Satisfiability Problem

Stepan G. Margaryan

This is the latest in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. In the previous papers, we have proved that the sat CNF p…