{"product_id":"problems-of-the-class-np-von-anatoly-plotnikov","title":"Problems of the class NP","description":"\u003cp\u003eProblems of the class NP ¿ it's almost all problems solved on the computer. Therefore, this is extremely important and actually to research the properties of  such problems and to construct their mathematical models, which allows in a number of cases to improve the solution algorithms or propose new ones. In studying the problems of the class NP we focused on the NP-complete problems, the researching their properties and constructing models. We construct a mathematical model of constructive combinatorial problems, clarify the concept of a class of problems solved by a non-deterministic Turing machine and  define the concept of the problem without foresight, investigate the set-theoretic properties of extreme combinatorial problems. We offer the polynomial-time algorithm for the maxumum independent set problem based on a hypotheses. Also, we find a criterion for Hamiltonicity of a graph and consider some covering problems. This book should be especially useful to professionals in computer sience.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783844393460\"\u003e\u003ch3\u003eResearch and simulating\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783844393460","offer_id":39497202925661,"sku":"9783844393460","price":59.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/33e3af58-bf65-4a43-8bc0-b7058cbb322e.jpg?v=1758953038","url":"https:\/\/shop.autorenwelt.de\/en\/products\/problems-of-the-class-np-von-anatoly-plotnikov","provider":"Autorenwelt Shop","version":"1.0","type":"link"}