Computational Complexity Hardback - 2008
by Oded Goldreich
- New
- Hardback
A$164.41
A$15.36
Delivery to USA
Standard delivery: 7 to 12 days
More delivery options
Standard delivery: 7 to 12 days
Ships from Ria Christie Collections (Greater London, United Kingdom)
Details
- Title Computational Complexity
- Author Oded Goldreich
- Binding Hardback
- Edition First edition
- Condition New
- Pages 632
- Volumes 1
- Language ENG
- Publisher Cambridge University Press, Cambridge
- Publication date 2008-04-28
- Illustrated Yes
- Features Bibliography, Illustrated, Index, Table of Contents
- Bookseller's Inventory # ria9780521884730_inp
- ISBN 9780521884730 / 052188473X
- Weight 2.76 lbs (1.25 kg)
- Dimensions 10.13 x 7.02 x 1.6 in (25.73 x 17.83 x 4.06 cm)
- Category Computers - General Information
- Library of Congress subjects Computational complexity, Turing machines
- Library of Congress Catalogue Number 2008006750
- Dewey Decimal Code 511.352
- Quantity available 784
About Ria Christie Collections Greater London, United Kingdom
Biblio member since 2014
Hello We are professional online booksellers. We sell mostly new books and textbooks and we do our best to provide a competitive price. We are based in Greater London, UK. We pride ourselves by providing a good customer service throughout, shipping the items quickly and replying to customer queries promptly. Ria Christie Collections
30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.
Summary
Complexity theory is a central field of the theoretical foundations of computer science. It is concerned with the general study of the intrinsic complexity of computational tasks; that is, it addresses the question of what can be achieved within limited time (and/or with other limited natural computational resources). This book offers a conceptual perspective on complexity theory. It is intended to serve as an introduction for advanced undergraduate and graduate students, either as a textbook or for self-study. The book will also be useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems. In each case, the author starts by posing the intuitive questions that are addressed by the sub-area and then discusses the choices made in the actual formulation of these questions, the approaches that lead to the answers, and the ideas that are embedded in these answers.
Reader reviews for Computational Complexity
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
