Suche ›

Complexity Theory

Exploring the Limits of Efficient Algorithms

Springer Berlin,
64,15 € Lieferbar in 5-7 Tagen
Dieses Produkt ist auch verfügbar als:


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.


Titel: Complexity Theory
Autoren/Herausgeber: Ingo Wegener
Übersetzer: R. Pruim
Ausgabe: Softcover reprint of hardcover 1st ed. 2005

ISBN/EAN: 9783642059148
Originaltitel: Komplexitätstheorie - Grenzen der Effizienz von Algorithmen
Originalsprache: Deutsch

Seitenzahl: 308
Format: 23,5 x 15,5 cm
Produktform: Taschenbuch/Softcover
Gewicht: 485 g
Sprache: Englisch

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. - Newsletter
Möchten Sie sich für den Newsletter anmelden?

Bitte geben Sie eine gültige E-Mail-Adresse ein.
Lieber nicht