Complexity Theory: Exploring the Limits of Efficient Algorithms

Wegener, Ingo und R. Pruim:

ISBN 10: 3540210458 / ISBN 13: 9783540210450

Edité par Springer, 2005

A propos de cet article

Seiten; Artikel stammt aus Nichtraucherhaushalt! AH10784 Sprache: Deutsch Gewicht in Gramm: 3. N° de réf. du vendeur 1203116

Détails bibliographiques

Titre : Complexity Theory: Exploring the Limits of ...

Éditeur : Springer

Date d'édition : 2005

Reliure : hardcover

Etat : Gut

A propos de ce titre

Synopsis :

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.

À propos de l?auteur:

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.