Bücher versandkostenfrei*100 Tage RückgaberechtAbholung in der Wunschfiliale
NEU: Das Hugendubel Hörbuch Abo - jederzeit, überall, für nur 7,95 € monatlich!
Jetzt entdecken
mehr erfahren
Zustellung: Sa, 27.09. - Di, 30.09.
Versand in 4 Tagen
VersandkostenfreiBestellen & in Filiale abholen:
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.
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.
Produktdetails
Erscheinungsdatum
13. Oktober 2010
Sprache
englisch
Auflage
Softcover reprint of hardcover 1st edition 2005
Seitenanzahl
320
Autor/Autorin
Ingo Wegener
Übersetzung
R. Pruim
Illustrationen
XII, 308 p.
Verlag/Hersteller
Produktart
kartoniert
Abbildungen
XII, 308 p.
Gewicht
487 g
Größe (L/B/H)
235/155/18 mm
ISBN
9783642059148
Entdecken Sie mehr
Pressestimmen
From the reviews:
"This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j)
"Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ... Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)
"This book should be important and useful for students of computer science as an introduction to complexity theory with an emphasis on randomized and approximation algorithms ... . It contains 16 chapters and extends from the foundations of modern complexity theory to recent developments with implications for concrete applications. ... The text is well written ... and the translation is successful." (Gerhard Lischke, Mathematical Reviews, Issue 2006 j)
"Complexity theory is an extremely important and vivid field on the border of mathematics and computer science. ... Ingo Wegener certainly created an appealing, well-written book that is a definite choice for the specialists and lecturers when an undergraduate or graduate student asks for guidance into this challenging new field of mathematics." (Péter Hajnal, Acta Scientiarum Mathematicarum, Vol. 71, 2005)
Bewertungen
0 Bewertungen
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "Complexity Theory" und helfen Sie damit anderen bei der Kaufentscheidung.