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

71,90 €*

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
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
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
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
Maße: 235 x 155 x 18 mm
Von/Mit: Ingo Wegener
Erscheinungsdatum: 13.10.2010
Gewicht: 0,487 kg
Artikel-ID: 107117093
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte

Buch
Cover: 9780387790510 | Introduction to Nonparametric Estimation | Alexandre B. Tsybakov | X
Introduction to Nonparametric Estimation
EAN: 9780387790510
Sprache: Englisch
Von/Mit: Alexandre B. Tsybakov

160,49 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9783528051730 | Rechnerarchitektur | Analyse, Entwurf, Implementierung, Bewertung
Rechnerarchitektur
Analyse, Entwurf, Implementierung, Bewertung
EAN: 9783528051730
Sprache: Deutsch
Von/Mit: David A. Patterson (u. a.)

54,99 €*

Aktuell nicht verfügbar

Buch
Cover: 9783540667452 | Arithmetik | Aus der Reihe The Art of Computer Programming | Knuth
Arithmetik
Aus der Reihe The Art of Computer Programming
EAN: 9783540667452
Sprache: Deutsch
Von/Mit: Donald E. Knuth

66,99 €*

Aktuell nicht verfügbar

Buch
Cover: 9783486705430 | Aufgabensammlung Analysis I | Friedmar Schulz | Buch | XIV | Deutsch
Aufgabensammlung Analysis I
EAN: 9783486705430
Sprache: Deutsch
Von/Mit: Friedmar Schulz

34,95 €*

Aktuell nicht verfügbar

Taschenbuch
Cover: 9781781333334 | Cracking The Data Code | Mike Bugembe | Taschenbuch | Paperback | 2018
Cracking The Data Code
Unlock the hidden value of data for your organisation
EAN: 9781781333334
Sprache: Englisch
Von/Mit: Mike Bugembe

20,60 €*

Aktuell nicht verfügbar

Buch
Cover: 9783751986571 | Das wahrhafte Unendliche und die Unendlichkeit der Mathematik | Buch
Das wahrhafte Unendliche und die Unendlichkeit der Mathematik
Die Entsprechungen zwischen Hegels Bestimmung des wahrhaften Unendlichen in der »Wissenschaft der Logik« und seiner...
EAN: 9783751986571
Sprache: Deutsch
Von/Mit: Henri Beaufort

19,99 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9780128099278 | Network Algorithmics | George Varghese (u. a.) | Taschenbuch | 2022
Network Algorithmics
An Interdisciplinary Approach to Designing Fast Networked Devices
EAN: 9780128099278
Sprache: Englisch
Von/Mit: George Varghese (u. a.)

93,80 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781032330235 | Software Design by Example | A Tool-Based Introduction with JavaScript
Software Design by Example
A Tool-Based Introduction with JavaScript
EAN: 9781032330235
Sprache: Englisch
Von/Mit: Greg Wilson

65,25 €*

Lieferzeit 1-2 Wochen

Taschenbuch
Cover: 9781032369396 | Algorithm Design: A Methodological Approach - 150 problems and...
Algorithm Design
A Methodological Approach - 150 problems and detailed solutions
EAN: 9781032369396
Sprache: Englisch
Von/Mit: Patrick Bosc (u. a.)

73,15 €*

Lieferzeit 1-2 Wochen

Broschüre
Cover: 9781572227965 | Calculus 1 | QuickStudy Laminated Reference Guide | Gerald Harnett
Calculus 1
QuickStudy Laminated Reference Guide
EAN: 9781572227965
Sprache: Englisch
Von/Mit: Gerald Harnett

9,75 €*

Lieferzeit 1-2 Werktage

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