Computability and Complexity Theory

This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations.  Subsequent chapters mov...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Homer, Steven (Autor), Selman, Alan L. (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: New York, NY : Springer US : Imprint: Springer, 2011.
Edición:2nd ed. 2011.
Colección:Texts in Computer Science,
Temas:
Computer science.
Algorithms.
Theory of Computation.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Preliminaries
  • Introduction to Computability
  • Undecidability
  • Introduction to Complexity Theory
  • Basic Results of Complexity Theory
  • Nondeterminism and NP-Completeness
  • Relative Computability
  • Nonuniform Complexity
  • Parallelism
  • Probabilistic Complexity Classes
  • Introduction to Counting Classes
  • Interactive Proof Systems
  • References
  • Author Index
  • Subject Index.

Ejemplares similares