Buch, Englisch, 308 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 487 g
Exploring the Limits of Efficient Algorithms
Buch, Englisch, 308 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 487 g
ISBN: 978-3-642-05914-8
Verlag: Springer
Reflects recent developments in its emphasis on randomized and approximation algorithms and communication models
All topics are considered from an algorithmic point of view stressing the implications for algorithm design
Zielgruppe
Graduate
Fachgebiete
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Interdisziplinäres Wissenschaften Wissenschaften: Forschung und Information Informationstheorie, Kodierungstheorie
- Mathematik | Informatik Mathematik Mathematische Analysis Moderne Anwendungen der Analysis
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmier- und Skriptsprachen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Informationstheorie, Kodierungstheorie
Weitere Infos & Material
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.
