Overview
- Neuartige Einführung in das klassische Gebiet der Komplexitätstheorie
- Integration moderner Themen wie PCP-Theorem, Nichtapproximierbarkeit, Randomisierung und Kommunikationskomplexität
- Informelle Darstellung von Beweis-Ideen, bevor formale Beweise folgen
Part of the book series: Springer-Lehrbuch (SLB)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (17 chapters)
Keywords
About this book
Authors and Affiliations
Bibliographic Information
Book Title: Komplexitätstheorie
Book Subtitle: Grenzen der Effizienz von Algorithmen
Authors: Ingo Wegener
Series Title: Springer-Lehrbuch
DOI: https://doi.org/10.1007/978-3-642-55548-0
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Softcover ISBN: 978-3-540-00161-4Published: 10 March 2003
eBook ISBN: 978-3-642-55548-0Published: 11 March 2013
Series ISSN: 0937-7433
Series E-ISSN: 2512-5214
Edition Number: 1
Number of Pages: X, 322
Topics: Coding and Information Theory, Computer System Implementation, Mathematical Logic and Foundations, Algorithm Analysis and Problem Complexity, Logics and Meanings of Programs, Mathematical Logic and Formal Languages