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 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
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

Buch
Cover: 9780691141954 | Distributed Control of Robotic Networks | Francesco Bullo (u. a.)
Distributed Control of Robotic Networks
A Mathematical Approach to Motion Coordination Algorithms a Mathematical Approach to Motion Coordination Algorithms
EAN: 9780691141954
Sprache: Englisch
Von/Mit: Francesco Bullo (u. a.)

92,15 €*

Lieferzeit 1-2 Werktage

Buch
Cover: 9783319071381 | SVA: The Power of Assertions in SystemVerilog | Eduard Cerny (u. a.)
SVA: The Power of Assertions in SystemVerilog
EAN: 9783319071381
Sprache: Englisch
Von/Mit: Eduard Cerny (u. a.)

149,95 €*

Lieferzeit 2-3 Wochen

Buch
Cover: 9783034802369 | The Tower of Hanoi - Myths and Maths | Andreas M. Hinz (u. a.) | Buch
The Tower of Hanoi - Myths and Maths
EAN: 9783034802369
Sprache: Englisch

58,84 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9783540652113 | Spieltheorie und ökonomische (Bei)Spiele | Werner Güth | Taschenbuch
Spieltheorie und ökonomische (Bei)Spiele
EAN: 9783540652113
Sprache: Deutsch
Von/Mit: Werner Güth

32,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: 9789811399671 | Fast Fourier Transform Algorithms for Parallel Computers | Takahashi
Fast Fourier Transform Algorithms for Parallel Computers
EAN: 9789811399671
Sprache: Englisch
Von/Mit: Daisuke Takahashi

106,95 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9781009014793 | A Course in Stochastic Game Theory | Eilon Solan | Taschenbuch | 2022
A Course in Stochastic Game Theory
EAN: 9781009014793
Sprache: Englisch
Von/Mit: Eilon Solan

46,40 €*

Lieferzeit 4-7 Werktage

Taschenbuch
Cover: 9781484285657 | Handbook for SAP PP in S/4HANA | Himanshu Goel | Taschenbuch | 2022
Handbook for SAP PP in S/4HANA
Production Planning and Execution in SAP S/4HANA
EAN: 9781484285657
Sprache: Englisch
Von/Mit: Himanshu Goel

69,30 €*

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: 9783608975192 | MERKUR Gegründet 1947 als Deutsche Zeitschrift für europäisches...
MERKUR Gegründet 1947 als Deutsche Zeitschrift für europäisches Denken - 8/2022
Nr. 879, Heft 8, August 2022
EAN: 9783608975192
Sprache: Deutsch
Von/Mit: Christian Demand (u. a.)

15,00 €*

Aktuell nicht verfügbar

Buch
Cover: 9780367263508 | The Pragmatic Programmer for Machine Learning | Marco Scutari (u. a.)
The Pragmatic Programmer for Machine Learning
Engineering Analytics and Data Science Solutions
EAN: 9780367263508
Sprache: Englisch
Von/Mit: Marco Scutari (u. a.)

103,50 €*

Aktuell nicht verfügbar

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