Complexity Theory : Exploring the Limits of Efficient Algorithms

Ingo Wegener

ISBN 10: 3642059147 / ISBN 13: 9783642059148

Editore: Springer Berlin Heidelberg, 2010

Riguardo questo articolo

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.

Codice articolo 9783642059148

Dati bibliografici

• Titolo: Complexity Theory : Exploring the Limits of Efficient Algorithms
• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 3642059147
• ISBN 13: 9783642059148
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 18 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 18 millimetri di profondità
• Peso: 487 grammi

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

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.