Computability and Complexity Theory

by Alan L. Selman and Steven Homer

Book Overview

Preliminaries.- Introduction to Computability.- Undecidability.- Introduction to Complexity Theory.- Basic Results of Complexity Theory.- Nondeterminism and NP-Completeness.- Relative Computability.-... This description may be from another edition of this product.

• Format: Hardcover
• Language: English
• ISBN: 0387950559
• ISBN13: 9780387950556
• Release Date: January 2001
• Publisher: Springer
• Length: 194 Pages
• Weight: 0.30 lbs.
• Dimensions: 0.6" x 7.2" x 9.5"

Customer Reviews

Computability and Complexity Theory is Complex

Computability and Complexity Theory (Texts in Computer Science) This book is dense, in the sense that there is a lot of information explained using very few words, which means you have to do some thinking to get anything out of it. You have to make sure you have a firm grasp on each concept before you go on, because they just keep building on each other. There's nothing necessarily bad about the book; but for the purpose of the class that I read the book for, it could have offered a little more by way of explanation and reminders, to help the student learn and understand what it was talking about.

In fact, it is a great and concise book on the subject

This book is aimed as an introductory text book on computer science theory. The book is suited for both undergraduate and graduate studies. I would have never expected a book of only a few pages to cover computability and complexity theory basics from introductory undergraduate to early graduate levels. This is because, the author focusses only on core concepts and strives to make them as clear and concise as possible using the power of the mathematical language. It explains the hard theory and logic by easy sentences and words. Even if you use English as foreign language you can read this book by yourself and understand its contents easily having a good background on mathematical language and mathematical thought.