Computability and Complexity Theory (Texts in Computer Science)

Homer, Steven, Selman, Alan L.

ISBN 10: 0387950559 / ISBN 13: 9780387950556

Edité par Springer, 2001

A propos de cet article

Like New.

N° de réf. du vendeur ERICA79603879505596

Détails bibliographiques

• Titre: Computability and Complexity Theory (Texts in Computer Science)
• Éditeur: Springer
• Date de parution: 2001
• Langue: anglais
• ISBN à 10 chiffres: 0387950559
• ISBN à 13 chiffres: 9780387950556
• Reliure: Hardcover
• État de l'article: Like New
• Type de livre: book

A propos de ce titre

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.