Picture 1 of 1
ENDED
Computational Complexity : A Modern Approach, Hardcover by Arora, Sanjeev; Ba...
Condition:
“Light wear to cover - Pages and covers are crisp and clean and have no markings - All items ”... Read moreabout condition
Price:
US $45.99
ApproximatelyC $63.02
Shipping:
Located in: Cincinnati, Ohio, United States
Delivery:
Estimated between Wed, Jun 26 and Fri, Jun 28 to 43230
Returns:
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:166750255279
Item specifics
- Condition
- Very Good
- Seller Notes
- Book Title
- Computational Complexity : A Modern Approach
- Personalized
- No
- ISBN
- 9780521424264
- Subject Area
- Computers
- Publication Name
- Computational Complexity : a Modern Approach
- Publisher
- Cambridge University Press
- Item Length
- 10.2 in
- Subject
- General, Data Processing
- Publication Year
- 2009
- Type
- Textbook
- Format
- Hardcover
- Language
- English
- Item Height
- 1.5 in
- Item Weight
- 98.1 Oz
- Item Width
- 7.3 in
- Number of Pages
- 594 Pages
About this product
Product Information
Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included.
Product Identifiers
Publisher
Cambridge University Press
ISBN-10
0521424267
ISBN-13
9780521424264
eBay Product ID (ePID)
71669845
Product Key Features
Number of Pages
594 Pages
Language
English
Publication Name
Computational Complexity : a Modern Approach
Publication Year
2009
Subject
General, Data Processing
Type
Textbook
Subject Area
Computers
Format
Hardcover
Dimensions
Item Height
1.5 in
Item Weight
98.1 Oz
Item Length
10.2 in
Item Width
7.3 in
Additional Product Features
LCCN
2009-002789
Dewey Edition
22
Reviews
"This book by two leading theoretical computer scientists provides a comprehensive,insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research." Richard M. Karp, University Professor, University of California at Berkeley, Pre-Publication Review: "This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource." Michael Sipser, MIT, author of Introduction to the Theory of Computation, 'This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource.' Michael Sipser, MIT, , author of Introduction to the Theory of Computation, "This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource." Michael Sipser, MIT, author of Introduction to the Theory of Computation, Pre-Publication Review: "Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field." Avi Wigderson, Professor, Institute for Advanced Study, Princeton, "Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field." Avi Wigderson, Professor, Institute for Advanced Study, Princeton, 'Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.' Avi Wigderson, Professor, Institute for Advanced Study, Princeton, 'This book by two leading theoretical computer scientists provides a comprehensive, insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research.' Richard M. Karp, University of California at Berkeley, "The reviewer's impressions are that this new textbook on computational complexity is available for a very attractive price and that on Amazon it may be verified that it has received very good reviews by several leaders in this field (Karp, Sipser, Wigderson)." Ulrich Tamm, Mathematical Reviews
Target Audience
Scholarly & Professional
Illustrated
Yes
Dewey Decimal
511.3/52
Lc Classification Number
Qa267.7 .A76 2009
Table of Content
Part I. Basic Complexity Classes: 1. The computational model - and why it doesn't matter; 2. NP and NP completeness; 3. Diagonalization; 4. Space complexity; 5. The polynomial hierarchy and alternations; 6. Boolean circuits; 7. Randomized computation; 8. Interactive proofs; 9. Cryptography; 10. Quantum computation; 11. PCP theorem and hardness of approximation: an introduction; Part II. Lower Bounds for Concrete Computational Models: 12. Decision trees; 13. Communication complexity; 14. Circuit lower bounds; 15. Proof complexity; 16. Algebraic computation models; Part III. Advanced Topics: 17. Complexity of counting; 18. Average case complexity: Levin's theory; 19. Hardness amplification and error correcting codes; 20. Derandomization; 21. Pseudorandom constructions: expanders and extractors; 22. Proofs of PCP theorems and the Fourier transform technique; 23. Why are circuit lower bounds so difficult?; Appendix A: mathematical background.
Copyright Date
2009
Item description from the seller
Seller assumes all responsibility for this listing.
eBay item number:166750255279
Shipping and handling
Item location:
Cincinnati, Ohio, United States
Ships to:
Afghanistan, Albania, Algeria, Andorra, Angola, Anguilla, Antigua and Barbuda, Argentina, Armenia, Aruba, Australia, Austria, Azerbaijan Republic, Bahamas, Bahrain, Bangladesh, Belgium, Belize, Benin, Bermuda, Bhutan, Bolivia, Bosnia and Herzegovina, Botswana, Brazil, Brunei Darussalam, Bulgaria, Burkina Faso, Burundi, Cambodia, Cameroon, Canada, Cape Verde Islands, Cayman Islands, Central African Republic, Chad, Chile, China, Colombia, Costa Rica, Cyprus, Czech Republic, Côte d'Ivoire (Ivory Coast), Democratic Republic of the Congo, Denmark, Djibouti, Dominican Republic, Ecuador, Egypt, El Salvador, Equatorial Guinea, Eritrea, Estonia, Ethiopia, Fiji, Finland, France, Gabon Republic, Gambia, Georgia, Germany, Ghana, Gibraltar, Greece, Greenland, Grenada, Guatemala, Guinea, Guinea-Bissau, Guyana, Haiti, Honduras, Hong Kong, Hungary, Iceland, India, Indonesia, Ireland, Israel, Italy, Jamaica, Japan, Jordan, Kazakhstan, Kenya, Kiribati, Kuwait, Kyrgyzstan, Laos, Latvia, Lebanon, Lesotho, Liberia, Liechtenstein, Lithuania, Luxembourg, Macau, Macedonia, Madagascar, Malawi, Malaysia, Maldives, Mali, Malta, Mauritania, Mauritius, Mexico, Moldova, Monaco, Mongolia, Montenegro, Montserrat, Morocco, Mozambique, Namibia, Nauru, Nepal, Netherlands, New Zealand, Nicaragua, Niger, Nigeria, Norway, Oman, Pakistan, Panama, Papua New Guinea, Paraguay, Peru, Philippines, Poland, Portugal, Qatar, Republic of Croatia, Republic of the Congo, Romania, Rwanda, Saint Kitts-Nevis, Saint Lucia, Saint Vincent and the Grenadines, San Marino, Saudi Arabia, Senegal, Serbia, Seychelles, Sierra Leone, Singapore, Slovakia, Slovenia, Solomon Islands, South Africa, South Korea, Spain, Sri Lanka, Suriname, Swaziland, Sweden, Switzerland, Taiwan, Tajikistan, Tanzania, Thailand, Togo, Tonga, Trinidad and Tobago, Tunisia, Turkey, Turkmenistan, Turks and Caicos Islands, Uganda, United Arab Emirates, United Kingdom, United States, Uruguay, Uzbekistan, Vanuatu, Vatican City State, Vietnam, Wallis and Futuna, Western Samoa, Yemen, Zambia, Zimbabwe
Excludes:
Barbados, French Guiana, French Polynesia, Guadeloupe, Libya, Martinique, New Caledonia, Reunion, Russian Federation, Ukraine, Venezuela
| Shipping and handling | To | Service | Delivery*See Delivery notes |
|---|---|---|---|
| US $4.87 (approx C $6.67) | United States | Economy Shipping (USPS Media MailTM) | Estimated between Wed, Jun 26 and Fri, Jun 28 to 43230 |
| US $5.52 (approx C $7.56) | United States | Standard Shipping (USPS Ground Advantage®) | Estimated between Wed, Jun 26 and Fri, Jun 28 to 43230 |
| US $6.01 (approx C $8.24) | United States | Standard Shipping (UPS Ground) | Estimated between Wed, Jun 26 and Fri, Jun 28 to 43230 |
| Handling time |
|---|
| Will usually ship within 1 business day of receiving cleared payment. |
| Taxes |
|---|
| Taxes may be applicable at checkout. Learn moreLearn more about paying tax on eBay purchases |
Sales tax for an item #166750255279
Sales tax for an item #166750255279
Seller collects sales tax for items shipped to the following provinces:
| Province | Sales Tax Rate |
|---|
Return policy
| After receiving the item, contact seller within | Refund will be given as |
|---|---|
| 30 days after the buyer receives it | Money Back |
The seller is responsible for return shipping costs.
Payment details
Payment methods
Seller feedback (5,484)
This item (1)
All items (5,484)
i***j (38)- Feedback left by buyer.
Past 6 months
Verified purchase
Item was in condition described and arrived VERY quickly! Super fast shipping!! Great seller!
h***o (74)- Feedback left by buyer.
Past 6 months
Verified purchase
Fast shipping and well packaged. Was exactly as it was described and exactly what I was looking for. Definitely would buy from again if it’s something I am looking for. Highly recommend.
i***j (38)- Feedback left by buyer.
Past 6 months
Verified purchase
Item was in condition described and arrived VERY quickly! Super fast shipping!! Great seller!
j***r (1436)- Feedback left by buyer.
Past 6 months
Verified purchase
fast shipping, item as described, excellent seller, A++++
Product ratings and reviews
More to explore:
- Modernism Fiction Hardcover Books,
- Modern Hardcover Antiquarian & Collectible Books,
- Modern Library Hardcover Antiquarian & Collectible Books,
- Computer Science Hardcover Textbooks,
- Computer & IT Computer Hardware Nonfiction Hardcover Books,
- Modern & Contemporary Fiction Hardcover Books,
- Hardcovers,
- Hardcover Books,
- Modern Hardcover Antiquarian & Collectible Books in German,
- Computer & IT Nonfiction Hardcovers Books in English