- Published Year: 2004
- Page count: 353
- File Size: 17 MB
- Language: English
- Published by: Elsevier Science
- Visited by: 370
- Rating/Review: 4.3
- ISBN: 9780444828415
Keywords:
Computational Complexity: A Quantitative Perspective
4.3
Reviews from our users
You Can Ask your questions from this book's AI after Login
Each download or ask from book AI costs 2 points. To earn more free points, please visit the Points Guide Page and complete some valuable actions.
One chapter is dedicated to abstract complexity theory, an older field which, however, deserves attention because it lays out the foundations of complexity. The other chapters, on the other hand, focus on recent and important developments in complexity. The book presents in a fairly detailed manner concepts that have been at the centre of the main research lines in complexity in the last decade or so, such as: average-complexity, quantum computation, hardness amplification, resource-bounded measure, the relation between one-way functions and pseudo-random generators, the relation between hard predicates and pseudo-random generators, extractors, derandomization of bounded-error probabilistic algorithms, probabilistically checkable proofs, non-approximability of optimization problems, and others.-
Free Direct Download
You Can Download this book after Login
Accessing books through legal platforms and public libraries not only supports the rights of authors and publishers but also contributes to the sustainability of reading culture. Before downloading, please take a moment to consider these options.
Find this book on other platforms:
WorldCat helps you find books in libraries worldwide.
See ratings, reviews, and discussions on Goodreads.
Find and buy rare or used books on AbeBooks.
1370
بازدید4.3
امتیاز0
نظر98%
رضایتReviews:
4.3
Based on 0 users review
Questions & Answers
Ask questions about this book or help others by answering
No questions yet. Be the first to ask!