Inicio > > Ciencias de la computación > Computability and Complexity Theory
Computability and Complexity Theory

Computability and Complexity Theory

Alan L. Selman / Steven Homer

132,44 €
IVA incluido
Consulta disponibilidad
Editorial:
Springer Nature B.V.
Año de edición:
2011
Materia
Ciencias de la computación
ISBN:
9781461406815

Selecciona una librería:

  • Librería Samer Atenea
  • Librería Aciertas (Toledo)
  • Kálamo Books
  • Librería Perelló (Valencia)
  • Librería Elías (Asturias)
  • Donde los libros
  • Librería Kolima (Madrid)
  • Librería Proteo (Málaga)

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.

Artículos relacionados

Otros libros del autor

  • Computability and Complexity Theory
    Alan L. Selman / Steven Homer
    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 move from the qualitative aspects of classical computability theory to the quantita...
    Disponible

    121,50 €

  • Computability and Complexity Theory
    Alan L. Selman / Steven Homer
    The theory of computing provides computer science with concepts, models, and formalisms for reasoning about both the resources needed to carry out computa­ tions and the efficiency of the computations that use these resources. lt provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems. Courses in this subject help...
    Disponible

    49,33 €