Zur Startseite gehen
0,00 €*
Cover: 9783642059148 | Complexity Theory | Exploring the Limits of Efficient Algorithms
Dekorationsartikel gehören nicht zum Leistungsumfang.
Complexity Theory
Exploring the Limits of Efficient Algorithms
Taschenbuch von Ingo Wegener
Sprache: Englisch

72,20 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:
Beschreibung
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.
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.
Über 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.

Zusammenfassung
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.
Inhaltsverzeichnis
Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions ¿ Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems ¿ Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.
Details
Erscheinungsjahr: 2010
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xii
308 S.
ISBN-13: 9783642059148
ISBN-10: 3642059147
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Wegener, Ingo
Übersetzung: Pruim, R.
Auflage: Softcover reprint of hardcover 1st ed. 2005
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 18 mm
Von/Mit: Ingo Wegener
Erscheinungsdatum: 13.10.2010
Gewicht: 0,487 kg
Artikel-ID: 107117093
Über 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.

Zusammenfassung
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.
Inhaltsverzeichnis
Algorithmic Problems & Their Complexity.- Fundamental Complexity Classes.- Reductions ¿ Algorithmic Relationships Between Problems.- The Theory of NP-Completeness.- NP-complete and NP-equivalent Problems.- The Complexity Analysis of Problems.- The Complexity of Approximation Problems ¿ Classical Results.- The Complexity of Black Box Problems.- Additional Complexity Classes and Relationships Between Complexity Classes.- Interactive Proofs.- The PCP Theorem and the Complexity of Approximation Problems.- Further Topics From Classical Complexity Theory.- The Complexity of Non-uniform Problems.- Communication Complexity.- The Complexity of Boolean Functions.
Details
Erscheinungsjahr: 2010
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Inhalt: xii
308 S.
ISBN-13: 9783642059148
ISBN-10: 3642059147
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Wegener, Ingo
Übersetzung: Pruim, R.
Auflage: Softcover reprint of hardcover 1st ed. 2005
Hersteller: Springer-Verlag GmbH
Springer Berlin Heidelberg
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 18 mm
Von/Mit: Ingo Wegener
Erscheinungsdatum: 13.10.2010
Gewicht: 0,487 kg
Artikel-ID: 107117093
Sicherheitshinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...