Computability and complexity theory

Authors:Steven Homer, Alan L. Selman

Summary:Suitable for use in an introductory graduate course in theoretical computer science, this title contains material that should be core knowledge in the theory of computation for various graduates in computer science. It starts with computability theory which forms the basis for complexity theory.

Print Book, English, 2001

Edition:View all formats and editions

Publisher: Springer, New York, 2001

Series:

Undergraduate texts in computer science

Physical Description:194 p. : ill. ; 24 cm.

ISBN:

9780387950556, 0387950559

OCLC Number / Unique Identifier:642164080

Subjects:

Complejidad computacional

Complejidad de cálculo (Informática)

Funciones computables

Informática teórica

Contents:

1. Preliminaries; 2. Introduction to Computability; 3. Undecidability; 4. Introduction to Complexity Theory; 5. Basic Results; 6. Nondeterminism and NP-Completeness; 7. Relative Computability

Notes:

Índices