Auf ein Miniaturbild klicken, um zu Google Books zu gelangen.
Lädt ... Computers and Intractability: A Guide to the Theory of NP-Completenessvon M. R. Garey, David S. Johnson
Lädt ...
Melde dich bei LibraryThing an um herauszufinden, ob du dieses Buch mögen würdest. Keine aktuelle Diskussion zu diesem Buch. NA keine Rezensionen | Rezension hinzufügen
Gehört zur Reihe
Literaturhinweise zu diesem Werk aus externen Quellen. Wikipedia auf Englisch (38)"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover. Keine Bibliotheksbeschreibungen gefunden. |
Aktuelle DiskussionenKeineBeliebte Umschlagbilder
Google Books — Lädt ... GenresMelvil Decimal System (DDC)519.4Natural sciences and mathematics Mathematics Applied Mathematics, Probabilities Applied numerical analysisKlassifikation der Library of Congress [LCC] (USA)BewertungDurchschnitt:
Bist das du?Werde ein LibraryThing-Autor. |