4 papers
Special Coverings of Sets and Boolean Functions
Stepan Margaryan
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…
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…
Necessary and sufficient conditions for Boolean satisfiability
Stepan G. Margaryan
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of a…
On a Certain NP-Complete Problem
Stepan Margaryan
We intend to create new concepts aimed at finding necessary and sufficient conditions for Boolean satisfiability so that these conditions can be verified in polynomial time. Based…