Complexity Theory (Paperback)

Ingo Wegener

ISBN 10: 3642059147 / ISBN 13: 9783642059148

Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2010

Beschreibung

Paperback. 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. Reflects recent developments in its emphasis on randomized and approximation algorithms and communication modelsAll topics are considered from an algorithmic point of view stressing the implications for algorithm design Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Bestandsnummer des Verkäufers 9783642059148

Bibliografische Details

• Titel: Complexity Theory (Paperback)
• Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
• Erscheinungsjahr: 2010
• Sprache: Englisch
• ISBN-10: 3642059147
• ISBN-13: 9783642059148
• Einband: Paperback
• Auflage: 1. Auflage
• Zustand: new

Über diesen Titel

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.