Theory of Computation by Dexter C. KozenTheory of Computation by Dexter C. Kozen

Theory of Computation

byDexter C. Kozen

Paperback | October 21, 2010

Pricing and Purchase Info

$131.30 online 
$150.50 list price save 12%
Earn 657 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises.
Title:Theory of ComputationFormat:PaperbackDimensions:418 pagesPublished:October 21, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:1849965714

ISBN - 13:9781849965712

Look for similar items by category:

Reviews

Table of Contents

The Complexity of Computations.- Time and Space Complexity Classes and Savitch's Theorem.- Separation Results.- Logspace Computability.- The Circuit Value Problem.- The Knaster-Tarski Theorem.- Alternation.- The Polynomial-Time Hierarchy.- Parallel Complexity.- Probabilistic Complexity.- Chinese Remaindering.- Berlekamp's Algorithm.- Interactive Proofs.- Probabilistically Checkable Proofs.- Complexity of Decidable Theories.- Complexity of the Theory of Real Addition.- Lower Bound for the Theory of Real Addition.- Safra's Construction.- Relativized Complexity.- Nonexistence of Sparse Complete Sets.- Unique Satisfiability.- Toda's Theorem.- Lower Bounds for Constant Depth Circuits.- The Switching Lemma.- Tail Bounds.- Applications of the Recursion Theorem.- The Arithmetic Hierarchy.- Complete Problems in the Arithmetic Hierarchy.- Post's Problem.- The Friedberg-Muchnik Theorem.- The Analytic Hierarchy.- Kleene's Theorem.- Fair Termination and Harel's Theorem.- Exercises.- Hints and Solutions.

Editorial Reviews

From the reviews:"This book represents the lecture notes of Dexter Kozen for the first-year graduate students in computer science at Cornell University. The book contains 41 primary lectures and 10 supplementary lectures covering more specialized and advanced topics. There are also 12 homework sets and several miscellaneous homework exercises . many with hints and complete solutions. . there is a bibliography of 127 titles. The book contains a very useful list of notations and abbreviations and an index." (Daniela Marinescu, Zentralblatt MATH, Vol. 1102 (4), 2007)"The book is a collection of lecture notes based on a one-semester course for first-year graduate students in computer science at Cornell . . The course serves a dual purpose: to cover material in the foundations of computing for graduate students in computer science preparing for their Ph.D. qualifying exams, and to provide an introduction to some more advanced topics in the theory of computational complexity for those intending to pursue further study in the area." (Ulrich Tamm, Mathematical Reviews, Issue 2007 f)"This textbook covers topics essential to the theory of computation. . In short, this is an interesting and enjoyable book that is strongly recommended to people who appreciate accuracy and concision. It will surely be an important textbook on the theory of computation for years to come. The intended audience is advanced undergraduate and first-year graduate students in computer science. It could also be useful to computer scientists with an interest in the foundation of computing and computational complexity." (G. Ciobanu, Computing Reviews, Vol. 49 (5), May, 2008)"Kozen does a great job of explaining the material. The book is a continuation of the author's excellent work in the field. The 12 homework sets, along with several miscellaneous problem sets, make this book an excellent pedagogical option for the classroom." (Hector Zenil, ACM Computing Reviews, Vol. 49 (9), September 2008)