Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Margaryan, Stepan G."'
Autor:
Margaryan, Stepan G.
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 problem is polynomially reduced to the problem of finding a special cov
Externí odkaz:
http://arxiv.org/abs/2310.19833
Autor:
Margaryan, Stepan G.
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 an algorithmic nature that are necessary and sufficient to transform an
Externí odkaz:
http://arxiv.org/abs/1910.10708