Computability and Complexity Theory 2011 Edition Contributor(s): Homer, Steven (Author), Selman, Alan L. (Author) |
|
ISBN: 1489989714 ISBN-13: 9781489989710 Publisher: Springer OUR PRICE: $94.99 Product Type: Paperback - Other Formats Published: March 2014 |
Additional Information |
BISAC Categories: - Computers | Computer Science - Computers | Programming - Algorithms - Mathematics |
Dewey: 004 |
Series: Texts in Computer Science |
Physical Information: 0.66" H x 6.14" W x 9.21" (0.98 lbs) 300 pages |
Descriptions, Reviews, Etc. |
Publisher Description: This revised and extensively expanded edition of Computability and Complexity Theory comprises essential materials that are core knowledge in the theory of computation. The book is self-contained, with a preliminary chapter describing key mathematical concepts and notations. Subsequent chapters move from the qualitative aspects of classical computability theory to the quantitative aspects of complexity theory. Dedicated chapters on undecidability, NP-completeness, and relative computability focus on the limitations of computability and the distinctions between feasible and intractable. Substantial new content in this edition includes:
With its accessibility and well-devised organization, this text/reference 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 the book an essential and practical learning tool.
Topics and features:
|