Apress

Theory of Computation

By Dexter C. Kozen

Theory of Computation Cover Image

A dual purpose textbook. It is uniquely written to cover core material in the foundations of computing for graduate students in computer science and to provide an introduction to some more advanced topics for those intending further study in the field.

Full Description

  • ISBN13: 978-1-8462-8297-3
  • 436 Pages
  • User Level: Students
  • Publication Date: September 19, 2006
  • Available eBook Formats: PDF
  • eBook Price: $109.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
This textbook has been written with the dual purpose to cover core material in the foundations of computing for graduate students in computer science, as well as to provide an introduction to some more advanced topics for those intending further study in the area. This book contains an invaluable collection of lectures for first-year graduates on the theory of computation, focusing primarily on computational complexity theory. Topics and features include: Organization into self-contained lectures of 3-7 pages; 41 primary lectures and a handful of supplementary lectures covering more specialized or advanced topics; 12 homework sets and several miscellaneous homework exercises of varying levels of difficulty, many with hints and complete solutions. Aimed at advanced undergraduates and first-year graduates in Computer Science or Mathematics with an interest in the theory of computation and computational complexity, this book provides a thorough grounding the foundations of computational complexity theory.
Table of Contents

Table of Contents

  1. The Complexity of Computations.
  2. Time and Space Complexity Classes and Savitch’s Theorem.
  3. Separation Results.
  4. Logspace Computability.
  5. The Circuit Value Problem.
  6. The Knaster
  7. Tarski Theorem.
  8. Alternation.
  9. The Polynomial
  10. Time Hierarchy.
  11. Parallel Complexity.
  12. Probabilistic Complexity.
  13. Chinese Remaindering.
  14. Berlekamp’s Algorithm.
  15. Interactive Proofs.
  16. Probabilistically Checkable Proofs.
  17. Complexity of Decidable Theories.
  18. Complexity of the Theory of Real Addition.
  19. Lower Bound for the Theory of Real Addition.
  20. Safra’s Construction.
  21. Relativized Complexity.
  22. Nonexistence of Sparse Complete Sets.
  23. Unique Satisfiability.
  24. Toda’s Theorem.
  25. Lower Bounds for Constant Depth Circuits.
  26. The Switching Lemma.
  27. Tail Bounds.
  28. Applications of the Recursion Theorem.
  29. The Arithmetic Hierarchy.
  30. Complete Problems in the Arithmetic Hierarchy.
  31. Post’s Problem.
  32. The Friedberg–Muchnik Theorem.
  33. The Analytic Hierarchy.
  34. Kleene’s Theorem.
  35. Fair Termination and Harel’s Theorem.
  36. Exercises.
  37. Hints and Solutions.
Errata

If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.

* Required Fields

No errata are currently published