or
Sign in to turn on 1-Click ordering.
 
 
Express Checkout with PayPhrase
What's this? | Create PayPhrase
More Buying Choices
36 used & new from $28.00

Have one to sell? Sell yours here
 
   
Computational Complexity
 
See larger image
 

Computational Complexity (Paperback)

~ (Author)
3.8 out of 5 stars  See all reviews (17 customer reviews)

List Price: $99.00
Price: $85.53 & this item ships for FREE with Super Saver Shipping. Details
You Save: $13.47 (14%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In Stock.
Ships from and sold by Amazon.com. Gift-wrap available.

Want it delivered Tuesday, November 17? Choose One-Day Shipping at checkout. Details
16 new from $57.80 20 used from $28.00

Formats

Amazon Price New from Used from
  Hardcover, December 31, 1993 -- $120.00 --
  Paperback, December 9, 1993 $85.53 $57.80 $28.00

Frequently Bought Together

Computational Complexity + Combinatorial Optimization: Algorithms and Complexity + Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Price For All Three: $160.97

Show availability and shipping details


Customers Who Bought This Item Also Bought

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)

by D. S. Johnson
4.8 out of 5 stars (13)  $61.87
Approximation Algorithms

Approximation Algorithms

by Vijay V. Vazirani
4.8 out of 5 stars (6)  $37.10
Introduction to the Theory of Computation, Second Edition

Introduction to the Theory of Computation, Second Edition

by Michael Sipser
4.5 out of 5 stars (54)  $117.32
Computational Complexity: A Modern Approach

Computational Complexity: A Modern Approach

by Sanjeev Arora
4.8 out of 5 stars (12)  $44.00
Introduction to Automata Theory,  Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

by John E. Hopcroft
3.7 out of 5 stars (44)  $101.47
Explore similar items

Editorial Reviews

Product Description

Offers a comprehensive and accessible treatment of the theory of algorithms and complexity. Develops all the necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics, and probability. DLC: Computational complexity.


From the Back Cover



0201530821B04062001

Product Details


More About the Author

Christos H. Papadimitriou
Discover books, learn about writers, read author blogs, and more.

Visit Amazon's Christos H. Papadimitriou Page

What Do Customers Ultimately Buy After Viewing This Item?


Tags Customers Associate with This Product

 (What's this?)
Click on a tag to find related items, discussions, and people.
 
(2)

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more

 

Customer Reviews

17 Reviews
5 star:
 (7)
4 star:
 (6)
3 star:
 (1)
2 star:    (0)
1 star:
 (3)
 
 
 
 
 
Average Customer Review
3.8 out of 5 stars (17 customer reviews)
 
 
 
 
Share your thoughts with other customers:
Most Helpful Customer Reviews

 
30 of 35 people found the following review helpful:
3.0 out of 5 stars Good Information, Poorly Executed, August 22, 2000
By Arthur Fischer (Calgary, Alberta) - See all my reviews
I used this book for a reading course in Complexity Theory. In going through the text, I found that though most topics were introduced in a fairly thorough manner, with enough axamples to make them understabdable, sometimes Papadimitriou would make some fairly simple mistakes. Of course, hese mistakes may be seen as typos in many places, but the sheer volume of them is difficult to attribute to typos alone. The readability of a proof, or a solution to an example is greatly reduced with the presence of inconsistent notations, and plain mathematical garbage.

The set of references and notes listed at the conclusion of most chapters was excellent, but the reader is to beware that some of the references listed are wrong (Cook's Theorem is from the 3rd ACM Symp. on Found. of Comp.Sci., not the 3rd IEEE Symp. on Found. of Comp. Sci., for instance).

These problems make it difficult for the comitted learner to get all the information he/she wants, and greatly detracted from my enjoyment of the text.

Unfortunately, I am unable to direct people to a more consistent text in Complexity Theory suitable for the senior undergrad through graduate levels.

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
10 of 11 people found the following review helpful:
5.0 out of 5 stars Excellent coverage of standard complexity topics, July 2, 1997
By A Customer
By far, the best book on complexity theory that I have ever read. I disagree with another reviewer's assessment of a lack of feasibility issues; that's not the focus of this book, nor should it be the focus of any book on complexity theory.

Papadimitriou's proofs are complete, concise, and understandable, which is more than I can say for most books on the subject. If you are interested in an in-depth coverage of a wide range of topics relating to complexity theory, this book is an excellent starting point. Highly recommended

Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)



 
7 of 8 people found the following review helpful:
5.0 out of 5 stars It is hard to catch some ideas, but it is worth reading, June 2, 2003
By Li Ping Chou "Ph.D from National Taiwan Unive... (San Chung City, Taipei Hsien Taiwan) - See all my reviews
(REAL NAME)   
Yes,it is generally "hard" for undergradute students even grad. students. If you are taking course "Theory of computation", I would like to recommend the Sipser's or Cohen's books for reading supplement. But you should keep reading this book ! IMO, this book covers so many topics, that it becomes too dense to read. It means you should read it carefully and slowly. For example, it introduces the "reduction" in some previous chapters but without precise defintion and therefore misses the more important part :how to do the reduction correctly and what is the "reseasonable" reduction ? You will find the concept of "reduction" is not very easy to catch if you refer to the Sipser's or Ullman's books. Many friends and me could not go through more than 20 pages of this book in the beginning. But we were keeping on reading and surveying some "easy books". Finally, we understood most half parts of this book. Moreover, if some readers prepare to study more advanced and recent topics, this book is the must.
Comment Comment | Permalink | Was this review helpful to you? Yes No (Report this)


Share your thoughts with other customers: Create your own review
 
 
 
Most Recent Customer Reviews

4.0 out of 5 stars Entertaining
We used this book for one semester when I was in the graduate school. This is one of the computer science related books that actually have enough substance to have some... Read more
Published 9 months ago by Yuanchyuan Sheu

4.0 out of 5 stars Computational Complexity - Christos Papadimitriou
Hello Amazon guys,
I would like to thank you for the successful purchasement of this book. It was delivered to me about a month after i ordered it. Read more
Published 13 months ago by Krum Bakalsky

5.0 out of 5 stars Excellent book, but you need some training
This book is excellent. However, you need strong training in the kind of reasoning used in math and CS theory before you can read it. Read more
Published on November 2, 2007 by W. Ghost

4.0 out of 5 stars good book for beginners
This is a good introductory book of computational theory for students in computer science, good juniors, seniors and first year graduates. Read more
Published on October 25, 2007 by Yi Feng

1.0 out of 5 stars The book is simply not useful
If your purpose is to learn something. This book is really bad at teaching you.

The author assumes many things. He has no idea of building things in a gradient. Read more
Published on February 5, 2006 by V. Sankar

4.0 out of 5 stars Good overall.
A well-written book that teaches you how to think about complexity theory instead of just a flat summary of results. Read more
Published on February 5, 2004 by Jason T

1.0 out of 5 stars All in one roof, but presentation very poor
I agree with the review by Arthur Fischer. Papadimitriou might
be an excellent researcher, but his communication skills are
hopeless and horrible. Read more
Published on June 3, 2003

5.0 out of 5 stars Challenging
I found this book hard to follow. However, I suspect I did not have the strong background in complexity theory required by it. Read more
Published on April 29, 2003 by Mugizi R. Rwebangira

5.0 out of 5 stars For the Student
As an undergraduate computer science student studying theory, I found this book facinating and helpful. It clearly explained the primary concepts of complexity. Read more
Published on May 5, 2002 by tenzig_shirpa

1.0 out of 5 stars terse grad school textbook
I bought this book after reading a review describing it as a good book on algorithm complexity. What I didn't know was that the book states in the preface: "This book in an... Read more
Published on January 24, 2002

Only search this product's reviews



Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 


Active discussions in related forums
Search Customer Discussions
Search all Amazon discussions
   




Product Information from the Amapedia Community

Beta (What's this?)


Look for Similar Items by Category


Look for Similar Items by Subject

 

Feedback

If you need help or have a question for Customer Service, contact us.
 Would you like to update product info or give feedback on images?
Is there any other feedback you would like to provide?

Your comments can help make our site better for everyone.


Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.