Showing 2019Show all
2 papers · 1 filter
cs.CC2019
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…
cs.CC2019
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…