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

70,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

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
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 320
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 Berlin
Springer Berlin Heidelberg
Maße: 235 x 155 x 18 mm
Von/Mit: Ingo Wegener
Erscheinungsdatum: 13.10.2010
Gewicht: 0,487 kg
preigu-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
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 320
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 Berlin
Springer Berlin Heidelberg
Maße: 235 x 155 x 18 mm
Von/Mit: Ingo Wegener
Erscheinungsdatum: 13.10.2010
Gewicht: 0,487 kg
preigu-id: 107117093
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Taschenbuch
Cover: 9783528069483 | Übungsbuch zur Numerischen Mathematik | Jürgen Herzberger | Buch
Übungsbuch zur Numerischen Mathematik
Typische Aufgaben mit ausgearbeiteten Lösungen zur Numerik und zum Wissenschaftlichen Rechnen
EAN: 9783528069483
Sprache: Deutsch
Von/Mit: Jürgen Herzberger

44,99 €*

Lieferzeit 4-7 Werktage

Buch
Cover: 9780470510469 | Numerical Sound Synthesis | Stefan Bilbao | Buch | 456 S. | Englisch
Numerical Sound Synthesis
Finite Difference Schemes and Simulation in Musical Acoustics
EAN: 9780470510469
Sprache: Englisch
Von/Mit: Stefan Bilbao

164,50 €*

Aktuell nicht verfügbar

Buch
Cover: 9783486720303 | Zahlentheorie und Zahlenspiele | Sieben ausgewählte Themenstellungen
Zahlentheorie und Zahlenspiele
Sieben ausgewählte Themenstellungen
EAN: 9783486720303
Sprache: Deutsch
Von/Mit: Ingo Althöfer (u. a.)

34,95 €*

Lieferzeit 2-3 Wochen

Buch
Cover: 9783540654315 | Complexity and Approximation | Giorgio Ausiello (u. a.) | Buch | XX
Complexity and Approximation
Combinatorial Optimization Problems and Their Approximability Properties
EAN: 9783540654315
Sprache: Englisch
Von/Mit: Giorgio Ausiello (u. a.)

79,10 €*

Lieferzeit 1-2 Werktage

Taschenbuch
Cover: 9783540653196 | Prozessautomatisierung 2 | Peter Göhner (u. a.) | Taschenbuch | XVI
Prozessautomatisierung 2
Modellierungskonzepte und Automatisierungsverfahren, Softwarewerkzeuge für den Automatisierungsingenieur,...
EAN: 9783540653196
Sprache: Deutsch
Von/Mit: Peter Göhner (u. a.)

64,99 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9783540633693 | A History of Algorithms | From the Pebble to the Microchip | Chabert
A History of Algorithms
From the Pebble to the Microchip
EAN: 9783540633693
Sprache: Englisch
Von/Mit: Jean-Luc Chabert

103,95 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9783030259617 | The Amazing Journey of Reason | from DNA to Artificial Intelligence
The Amazing Journey of Reason
from DNA to Artificial Intelligence
EAN: 9783030259617
Sprache: Englisch
Von/Mit: Mario Alemi

20,35 €*

Lieferzeit 1-2 Wochen

Buch
Cover: 9783110795882 | Mathematical Foundations of Data Science Using R | Buch | XVI | 2022
Mathematical Foundations of Data Science Using R
EAN: 9783110795882
Sprache: Englisch
Von/Mit: Frank Emmert-Streib (u. a.)

79,95 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781801810562 | Intelligent Document Processing with AWS AI/ML | Sonali Sahu | Buch
Intelligent Document Processing with AWS AI/ML
A comprehensive guide to building IDP pipelines with applications across industries
EAN: 9781801810562
Sprache: Englisch
Von/Mit: Sonali Sahu

48,95 €*

Lieferzeit 4-7 Werktage

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