- Paperback: 500 pages
- Publisher: Addison Wesley; 1 edition (Dec 10 1993)
- Language: English
- ISBN-10: 0201530821
- ISBN-13: 978-0201530827
- Product Dimensions: 24.1 x 16.8 x 2.7 cm
- Shipping Weight: 862 g
- Average Customer Review: 3.9 out of 5 stars See all reviews (12 customer reviews)
- Amazon Bestsellers Rank: #656,999 in Books (See Top 100 in Books)
- See Complete Table of Contents
|
||||||||||||||||||
|
||||||||||||||||||
|
||||||||||||||||||
| |||||||||||||||
Product Details |
Product Description
Book Description
This new text 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 performance and limitations of computer algorithms. Among topics covered are- reductions and NP- completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others.
Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self- contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.
Features
Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self- contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.
Features
First unified introduction to computational complexity.
Integrates computation, applications, and logic throughout.
Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.
Includes extensive exercises including historical notes, references, and challeging problems.
From the Back Cover
This new text 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 performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others.
Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.
Features
- First unified introduction to computational complexity.
- Integrates computation, applications, and logic throughout.
- Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.
- Includes extensive exercises including historical notes, references, and challeging problems.
0201530821B04062001
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most helpful customer reviews
4.0 out of 5 stars
Good overall.,
By Jason T (Canada) - See all my reviews
This review is from: Computational Complexity (Paperback)
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.
1.0 out of 5 stars
All in one roof, but presentation very poor,
By A Customer
This review is from: Computational Complexity (Paperback)
I agree with the review by Arthur Fischer. Papadimitriou mightbe an excellent researcher, but his communication skills are hopeless and horrible. The typos make learning even harder. Perhaps someone like Michael Sipser should take up the task of
5.0 out of 5 stars
Be careful, but it is worth reading,
By Li Ping Chou "Ph.D from National Taiwan Unive... (San Chung City, Taipei Hsien Taiwan) - See all my reviews (REAL NAME)
This review is from: Computational Complexity (Paperback)
Yes,it is generally "hard" for undergradute students even grad. students. If you are taking course "Theory of computing", I would like to recommend Sipser's or Cohen's books for introduction's supplement. However, this book covers too many topics, therefore becomes too dense, so that you should read it carefully. I admit that I could not go through more than 20 pages of this book in the beginning. But I was keeping on reading and surveying some "easy books". Finally, I understand most parts of this book. However, if some readers want some more advanced and recent topics. They should refer to some conference's papers hosted by ACM or IEEE.
Share your thoughts with other customers: Create your own review
Want to see more reviews on this item?
|
Most recent customer reviews |
Listmania!
Look for similar items by category
- Books > Computers & Internet > Computer Science
- Books > Computers & Internet > Hardware > Microprocessors & System Design > Computer Design
- Books > Computers & Internet > Programming > Software Design, Testing & Engineering > Logic
- Books > New & Used Textbooks > Computer Science & Information Systems > Computer Science
- Books > New & Used Textbooks > Computer Science & Information Systems > Programming Languages
- Books > New & Used Textbooks > Sciences > Mathematics
- Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics
- Books > Qualifying Textbooks - Fall 2007 > Computers & Internet
- Books > Qualifying Textbooks - Fall 2007 > Science
- Books > Science > Mathematics > Applied > Probability & Statistics
- Books > Science > Mathematics > Pure Mathematics > Logic
Look for similar items by subject
Feedback
Would you like to update product info or give feedback on images?
|
