_:n459d7d1f5d4745eca308cb466ce38aeaxb3
<http://schema.org/description>
"In this article, we introduce the concept of special decomposition of a set\nunder the given pairs of subsets of that set, and the concept of special\ncovering of a set under such a decomposition. We study the conditions for\nexistence of special coverings of sets, under special decomposition of the set.\nSuch conditions of formulated problem have important applications in the field\nof satisfiability of functions. Our goal is to study the relationship between\nsat CNF problem and the problem of existance of special covering of te set. We\nalso study the relationship between classes of computational complexity by\nsearching for special coverings of the sets. We prove, that the decidability of\nsat CNF problem, in polynomial time reduces to the problem of existence of a\nspecial covering of a set. We also prove, that the problem of existence of a\nspecial covering of a set, in polynomial time reduces to the decidability of\nthe sat CNF problem. Therefore, the mentioned problems are polynomially\nequivalent. And then, the problem of existence of a special covering of a set\nis NP-complete problem."
<https://deepai.org/profile/stepan-margaryan>