Complexity Theory Exploring the Limits of Efficient Algorithms /

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

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Wegener, Ingo (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Temas:
Computer programming.
Algorithms.
Coding theory.
Information theory.
Computer science.
Machine theory.
Programming Techniques.
Coding and Information Theory.
Computer Science Logic and Foundations of Programming.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares