Complexity Theory Exploring the Limits of Efficient Algorithms /

• Κύριος συγγραφέας: Wegener, Ingo (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Θέματα: Computer science.; Computer programming.; Coding theory.; Algorithms.; Computer logic.; Mathematical logic.; Computer Science.; Programming Techniques.; Algorithm Analysis and Problem Complexity.; Coding and Information Theory.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.

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

Πίνακας περιεχομένων:

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