Computability and Complexity Theory

Steven Homer et Alan L. Selman

ISBN 10: 0387950559 / ISBN 13: 9780387950556

Published by Springer-Verlag New York Inc., 2001

About this Item

Ancien livre de bibliothèque. Edition 2001. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2001. Ammareal gives back up to 15% of this item's net price to charity organizations. Seller Inventory # E-577-788

Bibliographic Details

Title: Computability and Complexity Theory

Publisher: Springer-Verlag New York Inc.

Publication Date: 2001

Binding: Hardcover

Condition: Très bon

About this title

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.

Review:

From the reviews: "The difference between this new introductory graduate textbook in theoretical computer science and other texts is that the authors have chosen to concentrate on computability theory and computational complexity theory. They motivate this focus by pointing out that most students have been introduced to the theory of automata and formal languages as undergraduates. The topics are treated in depth and in full formal detail. Explicit homework assignments are tightly integrated into the exposition of the material." --Computing Reviews "This book is intended for use in a modern graduate course in the theory of computing. ... Mainly all old classical complexity results as well as a relatively recent result that space-bounded classes are closed under complements are included into the book. The textbook is self-contained. A list of useful homework problems is appended to each chapter. The book is well written and is recommended to students as well as specialists in theoretical computer science." (Anatoly V. Anisimov, Zentralblatt MATH, Vol. 1033 (8), 2004) "This book is a solid textbook suited for one- or two-semester graduate courses on the theory of computing. ...The authors are two leading researchers in the field of theoretical computer sciences, most notably complexity theory. ... This textbook is an excellent resource and guide for those looking to develop a solid grounding in the theory of computing. Beginning graduates, advanced undergraduates and professionals involved in theoretical computer science, complexity theory and computability will find this book an essential and practical learning tool." (André Grosse, The Computer Journal, Vol. 45 (4), 2002)