Computability and Complexity Theory (Texts in Computer Science)

Homer, Steven; Selman, Alan L.

ISBN 10: 0387950559 / ISBN 13: 9780387950556

Edité par Springer, 2001

The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. N° de réf. du vendeur BSM.HZIM

Synopsis :

Intended for use in an introductory graduate course in theoretical computer science, this text contains material that should be core knowledge in the theory of computation for all graduates in computer science. It is self-contained and is best suited for a one semester course. The text starts with classical computability theory which forms the basis for complexity theory. This has the pedagogical advantage that students learn a qualitative subject before advancing to a quantitative one. Since this is a graduate course, students should have some knowledge of such topics as automata theory, formal languages, computability theory, or complexity theory.

Détails bibliographiques

Titre : Computability and Complexity Theory (Texts ...
Éditeur : Springer
Date d'édition : 2001
Reliure : Couverture rigide
Etat : good