Complexity Theory: Exploring the Limits of Efficient Algorithms
Wegener, Ingo
ISBN 10: 3642059147 ISBN 13: 9783642059148
Verlag: Springer, 2010
Neu
Softcover
Verkäufer
Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 25. März 2015
Dieser Artikel ist nicht mehr verfügbar.
Beschreibung
Beschreibung:
In. Bestandsnummer des Verkäufers ria9783642059148_new
Inhaltsangabe:
Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits what is possible with the available resources. The results prevent the search for non-existing efficient algorithms. The theory of NP-completeness has influenced the development of all areas of computer science. New branches of complexity theory react to all new algorithmic concepts. This textbook considers randomization as a key concept. The chosen subjects have implications to concrete applications. The significance of complexity theory for today’s computer science is stressed.
Über die Autorin bzw. den Autor:
The author is a full professor at the Computer Science Department of Dortmund University. He is the author of 8 monographs and more than 150 journal and conference articles. He was head of the German youth competition in computer science and has obtained the university medal for excellent teaching. He is an elected member of the German Academy of Sciences and was head of the committee reviewing computer research projects in Germany.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Bibliografische Details
Titel: Complexity Theory: Exploring the Limits of ...
Verlag: Springer
Erscheinungsdatum: 2010
Einband: Softcover
Zustand: New
Beste Suchergebnisse beim ZVAB
Foto des Verkäufers
Complexity Theory | Exploring the Limits of Efficient Algorithms
Anbieter: preigu, Osnabrück, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Complexity Theory | Exploring the Limits of Efficient Algorithms | Ingo Wegener | Taschenbuch | xii | Englisch | 2010 | Springer-Verlag GmbH | EAN 9783642059148 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Artikel-Nr. 107117093
Neu kaufen
EUR 71,30
EUR 70,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 5 verfügbar
Foto des Verkäufers
Complexity Theory
ISBN 10: 3642059147
ISBN 13: 9783642059148
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Neuware -Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 320 pp. Englisch. Artikel-Nr. 9783642059148
Neu kaufen
EUR 80,24
EUR 60,00 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 2 verfügbar
Foto des Verkäufers
Complexity Theory : Exploring the Limits of Efficient Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results- such as the theory of NP-completeness- have influenced the development of all areas of computer science.The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout. Artikel-Nr. 9783642059148
Neu kaufen
EUR 80,24
EUR 62,44 shipping
Versand von Deutschland nach USA
Versand von Deutschland nach USA
Anzahl: 1 verfügbar