Computability and Complexity Theory by Steven Homer
This book surveys theoretical computer science, presenting fundamental concepts and results. Updated and revised, the new edition includes two new chapters on nonuniform complexity, circuit complexity and parallel complexity, and randomized complexity.-
Java in Two Semesters
-
The Algorithm Design Manual
-
Guide to Discrete Mathematics
-
The Discrete Math Workbook
-
Computer Vision
-
The Data Science Design Manual
-
Programming Language Design and Implementation
-
Guide to AI for Cybersecurity
-
Guide to Graph Algorithms
-
Theory of Computation
-
Introduction to Databases
-
Mathematical Foundations of Software Engineering
-
Introduction to Assembly Language Programming
-
Understanding Concurrent Systems
-
Software Reliability Methods
-
Modal and Temporal Properties of Processes
-
Deduction Systems
-
Formal Languages and Compilation
-
Verification of Sequential and Concurrent Programs
-
Exploring Computational Geometry
-
Guide to Numerical Algorithm Design and Development
-
Fundamentals of the New Artificial Intelligence
-
Foundational Java
-
Guide to Graph Colouring
-
Guide to Industrial Analytics
-
Computational Intelligence
-
Guide to Intelligent Data Science
-
Programming in Two Semesters
-
Fundamentals of Computer Organization and Design
-
Algorithms on Trees and Graphs
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 theoryThey 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)
| SKU | Unavailable |
| ISBN 13 | 9781489989710 |
| ISBN 10 | 1489989714 |
| Title | Computability and Complexity Theory |
| Author | Steven Homer |
| Series | Texts In Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2014-03-03 |
| Number of pages | 300 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |