Picture 1 of 1
Gallery
Picture 1 of 1
Have one to sell?
Computational Complexity by Boaz & Sanjeev INTERNATIONAL EDITION
US $37.50
ApproximatelyRM 158.66
Condition:
Brand New
A new, unread, unused book in perfect condition with no missing or damaged pages.
Last one2 sold
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Shipping:
US $3.99 (approx RM 16.88) FedEx International Economy from Abroad.
Located in: LUCKNOW, UTTAR PRADESH, India
Delivery:
Estimated between Mon, 4 Aug and Tue, 5 Aug to 94104
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:294906131668
Item specifics
- Condition
- Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
- Features
- International Edition
- PRODUCT TYPE
- INTERNATIONAL EDITION PAPERBACK
- ISBN
- 9780521424264
About this product
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
Publication Name
Computational Complexity : a Modern Approach
Language
English
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
Intended Audience
Scholarly & Professional
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
Illustrated
Yes
Dewey Decimal
511.3/52
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.
Synopsis
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., This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem., This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
LC Classification Number
QA267.7 .A76 2009
Item description from the seller
Popular categories from this store
Seller feedback (814)
- d***a (49)- Feedback left by buyer.Past monthVerified purchaseExcellent!! Love the collection!! Great condition!!
- c***a (67)- Feedback left by buyer.Past monthVerified purchaseGood Quality
- 4***e (1281)- Feedback left by buyer.Past monthVerified purchaseGreat service and product. Thanks for the book
More to explore :
- Computer & IT Nonfiction Books Fiction & International Edition,
- Computer & IT Nonfiction Books in English Fiction & International Edition,
- International Edition Textbooks,
- International Edition Hardcover Textbooks,
- Management International Edition Textbooks,
- Nonfiction Books Fiction & International Cuisine International Edition,
- Nonfiction Books Hardcover International Edition,
- Nonfiction Paperbacks Books International Edition,
- Nonfiction Books Fiction & International Edition,
- Nonfiction Books in Russian Hardcover International Edition
Popular categories from this store
Seller feedback (814)
- d***a (49)- Feedback left by buyer.Past monthVerified purchaseExcellent!! Love the collection!! Great condition!!
- c***a (67)- Feedback left by buyer.Past monthVerified purchaseGood Quality
- 4***e (1281)- Feedback left by buyer.Past monthVerified purchaseGreat service and product. Thanks for the book