Computational Complexity 1st Edition

by Christos H. Papadimitriou (Author)

19 customer reviews

ISBN-13: 978-0201530827

ISBN-10: 0201530821

Why is ISBN important?

Trade in your item
Get a $17.79
Gift Card.

Trade in
Learn More

Have one to sell? Sell on Amazon

Buy used On clicking this link, a new layer will be open

$84.00 On clicking this link, a new layer will be open

Condition: Used - Good

In Stock. Sold by Smart Book - Deals, Fulfilled by Amazon

Access codes and supplements are not guaranteed with used items.

27 Used from $36.03

FREE Shipping

Buy new On clicking this link, a new layer will be open

$167.80 On clicking this link, a new layer will be open

Only 2 left in stock (more on the way).

Ships from and sold by Amazon.com. Gift-wrap available.

Want it Monday, Oct. 24? Order within and choose One-Day Shipping at checkout. Details

25 New from $101.71

FREE Shipping.

Turn on 1-Click ordering

Ship to:

Select a shipping address:

More Buying Choices

25 New from $101.71 27 Used from $36.03

52 used & new from $36.03

See All Buying Options

Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

This modern introduction to the Theory of Computer Science is the first unified introduction to Computational Complexity. I+ offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the pe@ormance and limitations of computer algorithms. The book is self-contained in that it develops all necessary mathematical prerequisites from such diverse fields such as computability, logic, number theory and probability.

Computational Complexity

$167.80 FREE Shipping. Only 2 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.

Frequently Bought Together

Total price: $304.01

Buy the selected items together

This item:Computational Complexity by Christos H. Papadimitriou Paperback $167.80
In Stock.
Ships from and sold by Amazon.com.
FREE Shipping. Details
Computational Complexity: A Modern Approach by Sanjeev Arora Hardcover $50.72
In Stock.
Ships from and sold by Amazon.com.
FREE Shipping. Details
The Nature of Computation by Cristopher Moore Hardcover $85.49
In Stock.
Ships from and sold by Amazon.com.
FREE Shipping. Details

Customers Who Bought This Item Also Bought

Page 1 of 1 Start overPage 1 of 1

This shopping feature will continue to load items. In order to navigate out of this carousel please use your heading shortcut key to navigate to the next or previous heading.

Sanjeev Arora

26

Hardcover
$50.72
Michael R. Garey

19

Paperback
$74.58
Cristopher Moore

16

Hardcover
$85.49
Thomas H. Cormen

418

Hardcover
$66.32
Sipser

82

Paperback
Christos H.…

26

Paperback
$15.06

Customers Viewing This Page May Be Interested In These Sponsored Links

(What's this?)

NO_CONTENT_IN_FEATURE

Product Details

Paperback: 523 pages
Publisher: Pearson; 1 edition (December 10, 1993)
Language: English
ISBN-10: 0201530821
ISBN-13: 978-0201530827
Product Dimensions: 6.3 x 1.3 x 9.1 inches
Shipping Weight: 1.9 pounds (View shipping rates and policies)
Average Customer Review: 3.8 out of 5 stars See all reviews (19 customer reviews)
Amazon Best Sellers Rank: #775,782 in Books (See Top 100 in Books)
- #89 in Books > Computers & Technology > Hardware & DIY > Microprocessors & System Design > Computer Design
- #341 in Books > Science & Math > Mathematics > Pure Mathematics > Logic
- #2741 in Books > Textbooks > Computer Science > Programming Languages

Would you like to update product info or give feedback on images?

Important Information

Ingredients

Example Ingredients

Directions

Example Directions

Customers Viewing This Page May Be Interested In These Sponsored Links

(What's this?)

Customer Reviews

3.8 out of 5 stars

5 star		37%
4 star		42%
3 star		5%
2 star		0%
1 star		16%

Write a customer review

See all 19 customer reviews

Top Customer Reviews

Good Information, Poorly Executed

ByArthur Fischeron August 22, 2000

Format: Paperback

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.

0Comment 52 people found this helpful. Was this review helpful to you?YesNo

Excellent coverage of standard complexity topics

ByA customeron July 2, 1997

Format: Paperback

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

0Comment 18 people found this helpful. Was this review helpful to you?YesNo

It is hard to catch some ideas, but it is worth reading

ByLi Ping Chouon June 2, 2003

Format: Paperback

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.

0Comment 13 people found this helpful. Was this review helpful to you?YesNo

Excellent book, but you need some training

ByW. Ghoston November 2, 2007

Format: PaperbackVerified Purchase

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. The subject gets very abstract, and may be hard to follow (and that's not Papadimitriou's fault).

I would recommend it for people who have already read Sipser's book (working on the exercises), for example.

0Comment 8 people found this helpful. Was this review helpful to you?YesNo

An excellent inroduction to computational complexity

ByTodd Eberton September 14, 2000

Format: Paperback

Papadimitriou is one of the great minds in computer science, which is reflected in this gem of a book. His prose is very engaging and he covers just about every topic (although be it lightly) relevant in modern complexity theory without overly diluting the proofs and results (for example, he gives a nice concise proof of Razborov's theorem on monotone circuits).

11 comment 14 people found this helpful. Was this review helpful to you?YesNo

For the Student

ByAmazon Customeron May 5, 2002

Format: Paperback

As an undergraduate computer science student studying theory, I found this book facinating and helpful. It clearly explained the primary concepts of complexity. The theorems are useful and the proofs are fairly straightforward. All in all, an interesting read. He spends a little bit too much time on logic, and his proof of Rice's theorem is a bit odd, but all in all this is a great book.

0Comment 5 people found this helpful. Was this review helpful to you?YesNo

Entertaining

ByYuanchyuan Sheuon February 16, 2009

Format: Paperback

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 intellectual value.

I found this volume entertaining years after leaving graduate school and working in the industry as an engineer. The topics addressed in this book is actually quite intriguing--the best time to reduce programming complexity is before one actually programs. I believe any serious programmer should be able to estimate the complexity, both space and time, on the algorithm he is designing.

In the real world, one does not encounter nontrivial algorithms very often, and from a practical perspective, this books is not quite useful.

However, when you really get bored, this is something that could entertain your brain a little.

0Comment 4 people found this helpful. Was this review helpful to you?YesNo

good book for beginners

BySmugon October 25, 2007

Format: PaperbackVerified Purchase

This is a good introductory book of computational theory for students in computer science, good juniors, seniors and first year graduates. The book is well presented, fit for self studies, and covered most contents of computability and complexity. The book is slightly old, some of the latest result are not included, e.g., a P-algorithm of solving "prime problem" was found in 2001. This book is not good for advanced researchers in theoretical computer science, it is way to shallow. Compared with Martin Davis's book, this is easier to understand, equally well presented. Be sure not to get the $8-9 version, that is not the book, although under the same title.

I am a research in theoretical algorithms.

0Comment 4 people found this helpful. Was this review helpful to you?YesNo

Customer Images

See all customer images

Most Recent Customer Reviews

Four Stars

explains the concepts well

Published 3 months ago by Amazon Customer

Excellent book in complexity theory

This is a great book on complexity theory at a graduate school level.
I would recommend this book to anyone interested in the field of complexity theory.

Published on April 17, 2014 by susavisa

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 on October 5, 2008 by Krum Bakalsky

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

Good overall.

A well-written book that teaches you how to think about complexity theory instead of just a flat summary of results.

Published on February 5, 2004 by Jason T

The classic approach to complexity theory

[2016 review] Given the rapidity of technological development, the CS beginner may be surprised to learn that older textbooks contain much that is valuable: as with the rise of...Read more

Published on December 8, 2003 by Jeffrey Rubard

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

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...Read more

Published on January 24, 2002

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway

This item: Computational Complexity

Set up a giveaway

What Other Items Do Customers Buy After Viewing This Item?

Computational Complexity: A Modern Approach Hardcover

Sanjeev Arora

26

$50.72
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Paperback

Christos H. Papadimitriou

26

$15.06
Introduction to Algorithms, 3rd Edition (MIT Press) Hardcover

Thomas H. Cormen

418

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

Michael R. Garey

19

$74.58

Conditions of Use
Privacy Notice
Interest-Based Ads

6pm Score deals on fashion brands	AbeBooks Rare Books & Textbooks	ACX Audiobook Publishing Made Easy	Alexa Actionable Analytics for the Web	Amazon Business Everything For Your Business	AmazonFresh Groceries & More Right To Your Door

AmazonGlobal Ship Orders Internationally	Home Services Handpicked Pros Happiness Guarantee	Amazon Inspire Free Digital Educational Resources	Amazon Video Direct Video Distribution Made Easy	Amazon Web Services Scalable Cloud Computing Services	Audible Download Audio Books

BeautyBar.com Prestige Beauty Delivered	Book Depository Books With Free Delivery Worldwide	Casa.com Kitchen, Storage & Everything Home	ComiXology Thousands of Digital Comics	CreateSpace Indie Print Publishing Made Easy	Diapers.com Everything But The Baby

DPReview Digital Photography	East Dane Designer Men's Fashion	Fabric Sewing, Quilting & Knitting	Goodreads Book reviews & recommendations	IMDb Movies, TV & Celebrities	Junglee.com Shop Online in India

Kindle Direct Publishing Indie Digital Publishing Made Easy	Prime Now FREE 2-Hour Delivery on Everyday Items	Prime Photos Unlimited Photo Storage Free With Prime	Shopbop Designer Fashion Brands	Soap.com Health, Beauty & Home Essentials	TenMarks.com Math Activities for Kids & Schools

Wag.com Everything For Your Pet	Warehouse Deals Open-Box Discounts	Whispercast Discover & Distribute Digital Content	Woot! Deals and Shenanigans	Yoyo.com A Happy Place To Shop For Toys	Zappos Shoes & Clothing

Computational Complexity 1st Edition

Sorry, there was a problem.

Sorry, there was a problem.

Buy used On clicking this link, a new layer will be open $84.00 On clicking this link, a new layer will be open

Turn on 1-Click ordering

Buy new On clicking this link, a new layer will be open $167.80 On clicking this link, a new layer will be open

Turn on 1-Click ordering

or

or

Frequently Bought Together

Customers Who Bought This Item Also Bought

Customers Viewing This Page May Be Interested In These Sponsored Links

Product Details

Important Information

Ingredients

Directions

Customers Viewing This Page May Be Interested In These Sponsored Links

Customer Reviews

Top Customer Reviews

Customer Images

Most Recent Customer Reviews

Set up an Amazon Giveaway

What Other Items Do Customers Buy After Viewing This Item?

Buy used On clicking this link, a new layer will be open

$84.00 On clicking this link, a new layer will be open

Buy new On clicking this link, a new layer will be open

$167.80 On clicking this link, a new layer will be open