|
|
Message from Dean - May 8th 2007
I am currently testing out a new version of the APF Bridge Component - If you notice any errors within this demo store please drop me a line.
List Price: $84.00Amazon.com's Price: $67.20 You Save: $16.80 (20%)Prices subject to change.
Availability: Usually ships in 24 hours
This item ships for FREE with Super Saver Shipping.
Binding: Paperback
Dewey Decimal Number: 511.3
EAN: 9780201530827
ISBN: 0201530821
Label: Addison Wesley
Manufacturer: Addison Wesley
Number Of Items: 1
Number Of Pages: 523
Publication Date: December 10, 1993
Publisher: Addison Wesley
Studio: Addison Wesley
Related Items:
Browse for similar items by category:
Editorial Review:
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.
Average Rating: 
Rating: -
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. The book is in very good condition. However, it has some scratches on the covers, due to, probably, transportation issues and the mechanical deformation that it has suffered being packed with many other stuff in the plane/train ?. So purchasing a book from the internet is slightly different from bying the book directly from a bookstore, but as for my first international and online order i am pretty satisfied and would rate it 5.5/6.0. Thank you once again, i will probably come back for some other order!
Krum.
Rating:  -
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.
Rating: -
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.
Rating:  -
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. He leaves out the details of how something was arrived at.
If his purpose is to show off, then he has achieved. If his purpose is to create a text that is readable and understandable. He has failed.
Rating: -
A well-written book that teaches you how to think about complexity theory instead of just a flat summary of results. Something like Lewis and Papadimitriou's _Elements of the Theory of Computation_ would be more than enough preparation for this (note that the style of these books is quite different- this one is more informal and descriptive). Covers all the material you need in a first text. Has a good little introduction to mathematical logic in it, including a nice succinct version of Godels Incompleteness Theorem. Lots of interesting exercises.
Availability: Usually ships in 24 hours
|
Amazon Store 