{"product_id":"on-the-class-of-np-complete-problems-and-rank-approach-von-sergey-listrovoy","title":"On the class of NP-complete problems and rank approach","description":"\u003cp\u003eIt is shown an incorrectness of introduction of a class of NP-complete problems, which reason is that Cook¿s S.¿. theorem on that the ¿satisfiability¿ problem is the universal NP-complete problem, is not true and, therefore, the issue on existence of at least one NP-complete problem remains open, that explains failures of attempts to estimate correlations between P and NP classes. Developed a universal procedure for solving a wide range of discrete optimization problems, which can be efficiently parallelized based on cyclic structures.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783659549052\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783659549052","offer_id":39467343773789,"sku":"9783659549052","price":49.9,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/80d82eec-be59-49a3-b31a-4f315b672594.jpg?v=1774681242","url":"https:\/\/shop.autorenwelt.de\/en\/products\/on-the-class-of-np-complete-problems-and-rank-approach-von-sergey-listrovoy","provider":"Autorenwelt Shop","version":"1.0","type":"link"}