Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2011
ISBN 10 : 3844393463 ISBN 13 : 9783844393460
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
EUR 138,71
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2011
ISBN 10 : 3844393463 ISBN 13 : 9783844393460
Vendeur : preigu, Osnabrück, Allemagne
EUR 50,35
Quantité disponible : 5 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. Problems of the class NP | Research and simulating | Anatoly Plotnikov | Taschenbuch | 152 S. | Englisch | 2011 | LAP LAMBERT Academic Publishing | EAN 9783844393460 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu Print on Demand.
Langue: anglais
Edité par LAP LAMBERT Academic Publishing, 2011
ISBN 10 : 3844393463 ISBN 13 : 9783844393460
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 59,71
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Problems 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.