Complexity Theory [electronic resource] :Exploring the Limits of Efficient Algorithms / by Ingo Wegener.
by Wegener, Ingo [author.]; SpringerLink (Online service).
Material type:
BookPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: XII, 308 p. 31 illus. online resource.ISBN: 9783540274773.Subject(s): Computer science | Coding theory | Computer software | Logic design | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Coding and Information Theory | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | AlgorithmsDDC classification: 005.1 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.9.A43 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| QA76.9.A43 Parameterized and Exact Computation | QA76.9.A43 Applied Algorithms | QA76.9.A43 Algorithms and Computation | QA76.9.A43 Complexity Theory | QA76.9.A43 Design and Analysis of Randomized Algorithms | QA76.9.A43 Introduction to Reliable Distributed Programming | QA76.9.A43 Parameterized Complexity Theory |
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.
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.
There are no comments for this item.