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.
Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models All topics are considered from an algorithmic point of view stressing the implications for algorithm design
- Verlag: Springer, Berlin
- Artikelnr. des Verlages: 10988367
- Erscheinungstermin: April 2005
- Abmessung: 243mm x 164mm x 24mm
- Gewicht: 645g
- ISBN-13: 9783540210450
- ISBN-10: 3540210458
- Artikelnr.: 12954551
"This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms … . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. … The text is well written … and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j)
"Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. … Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)