Complexity Theory Exploring the Limits of Efficient Algorithms

Complexity Theory Exploring the Limits of Efficient Algorithms / by Ingo Wegener.

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

Full description

Saved in:
Bibliographic Details
Main Author: Wegener, Ingo (Author)
Corporate Author: SpringerLink (Online service)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edition:1st ed. 2005.
Series:Springer eBook Collection.
Subjects:
Computer programming.
Algorithms.
Coding theory.
Information theory.
Computer logic.
Mathematical logic.
Electronic resources (E-books)
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.

Similar Items