Theory of Computation / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$74.77
Used and New from Other Sellers
Used and New from Other Sellers
from $40.80
Usually ships in 1-2 business days
(Save 62%)
Other sellers (Hardcover)
  • All (10) from $40.80   
  • New (7) from $45.73   
  • Used (3) from $40.80   

Overview

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.

Read More Show Less

Editorial Reviews

From the Publisher
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)

Read More Show Less

Product Details

  • ISBN-13: 9781846282973
  • Publisher: Springer London
  • Publication date: 5/28/2006
  • Series: Texts in Computer Science Series
  • Edition description: 2006
  • Edition number: 1
  • Pages: 418
  • Product dimensions: 7.20 (w) x 9.30 (h) x 1.10 (d)

Table of Contents

Lectures.- The Complexity of Computations.- Time and Space Complexity Classes and Savitch’s Theorem.- Separation Results.- The Immerman-Szelepcsényi Theorem.- Logspace Computability.- The Circuit Value Problem.- The Knaster-Tarski Theorem.- Alternation.- Problems Complete for PSPACE.- The Polynomial-Time Hierarchy.- More on the Polynomial-Time Hierarchy.- Parallel Complexity.- Relation of NC to Time-Space Classes.- Probabilistic Complexity.- BPP—2P——2P.- Chinese Remaindering.- Complexity of Primality Testing.- Berlekamp’s Algorithm.- Interactive Proofs.- PSPACE IP.- IP PSPACE.- Probabilistically Checkable Proofs.- NP PCP(n3, 1).- More on PCP.- A Crash Course in Logic.- Complexity of Decidable Theories.- Complexity of the Theory of Real Addition.- Lower Bound for the Theory of Real Addition.- Lower Bound for Integer Addition.- Automata on Infinite Strings and S1S.- Determinization of—-Automata.- Safra’s Construction.- Relativized Complexity.- Nonexistence of Sparse Complete Sets.- Unique Satisfiability.- Toda’s Theorem.- Circuit Lower Bounds and Relativized PSPACE = PH.- Lower Bounds for Constant Depth Circuits.- The Switching Lemma.- Tail Bounds.- The Gap Theorem and Other Pathology.- Partial Recursive Functions and Gödel Numberings.- Applications of the Recursion Theorem.- Abstract Complexity.- 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.- Homework 1.- Homework 2.- Homework 3.- Homework 4.- Homework 5.- Homework 6.- Homework 7.- Homework 8.- Homework 9.- Homework 10.- Homework 11.- Homework 12.- Miscellaneous Exercises.- Hints and Solutions.- Homework 1 Solutions.- Homework 2 Solutions.- Homework 3 Solutions.- Homework 4 Solutions.- Homework 5 Solutions.- Homework 6 Solutions.- Homework 7 Solutions.- Homework 8 Solutions.- Homework 9 Solutions.- Homework 10 Solutions.- Homework 11 Solutions.- Homework 12 Solutions.- Hints for Selected Miscellaneous Exercises.- Solutions to Selected Miscellaneous Exercises.

Read More Show Less

Customer Reviews

Average Rating 5
( 1 )
Rating Distribution

5 Star

(1)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing 1 Customer Reviews
  • Posted June 3, 2013

    WOW... I love MyDeals247 model - they create competition among t

    WOW... I love MyDeals247 model - they create competition among the sellers real-time.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing 1 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)