This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.
FREE Two-Day Shipping for students on millions of items. Learn more |
 Sell Back Your Copy for $17.56
Whether you buy it used on Amazon for $39.22 or somewhere else, you can sell it back through our Book Trade-In Program at the current price of $17.56.
Used Price$39.22
Trade-in Price$17.56
Price after
Trade-in$21.66 |
Book Description
Frequently Bought Together
Editorial Reviews
Review
"This interesting book... is refreshing to read his [Goldreichs'] opinions... The very strong focus on conceptual issues makes the book indispensible as a reference volume for research libraries."
M. Bona, University of Florida, CHOICE
"This book provides very well developed material that should interest advanced students either studying or doing new work on computational complexity. It would also be a valuable text for professionals challenged with solving "hard" computing problems of intending to exploit these types of problems when designing of new types computing systems."
Brian A. Lawler, Software Engineering Notes
"The book offers a conceptual perspective on several sub-areas of complexity theory and is intended to be used as a textbook for students and educators as well as for experts who seek an overview of of several sub-areas."
Gerhard Lischke, Mathematical Reviews
M. Bona, University of Florida, CHOICE
"This book provides very well developed material that should interest advanced students either studying or doing new work on computational complexity. It would also be a valuable text for professionals challenged with solving "hard" computing problems of intending to exploit these types of problems when designing of new types computing systems."
Brian A. Lawler, Software Engineering Notes
"The book offers a conceptual perspective on several sub-areas of complexity theory and is intended to be used as a textbook for students and educators as well as for experts who seek an overview of of several sub-areas."
Gerhard Lischke, Mathematical Reviews
Book Description
This book offers a conceptual introduction to the study of the intrinsic complexity of computational tasks. It is intended to serve advanced undergraduate and graduate students, either as a textbook or for self-study. It is also useful to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness, and probabilistic proof systems.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
complexity theory, kolmogorov complexity, graph isomorphism, coding lemma, uniform generation problem, natural approximation problems, pairwise independence generator, approximate counting procedure, distributional search problems, natural search problems, samplable ensembles, decision problem implicit, constant query complexity, probabilistic verification procedures, checkable solutions, logarithmic randomness, probabilistic proof systems, potential distinguisher, neighboring hybrids, random sieve, logarithmic space complexity, exponential circuit complexity, machines that take advice, resulting arithmetic expression, checkable proof systems Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Sketch, Polynomial-Time Hierarchy, Set Cover, Cobham-Edmonds Thesis, Bounded Non-halting, Computational Complexity, Expander Random Walk Generator, Graph Non-Isomorphism, Bounded Halting, Combining Theorem, Using Theorem, Halting Problem, Post Correspondence Problem, Rice's Theorem, Use the Probabilistic Method, Church-Turing Thesis, Extra Guideline, Arthur-Merlin Games, Chebyshev's Inequality, Motivating Remark Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
complexity theory, kolmogorov complexity, graph isomorphism, coding lemma, uniform generation problem, natural approximation problems, pairwise independence generator, approximate counting procedure, distributional search problems, natural search problems, samplable ensembles, decision problem implicit, constant query complexity, probabilistic verification procedures, checkable solutions, logarithmic randomness, probabilistic proof systems, potential distinguisher, neighboring hybrids, random sieve, logarithmic space complexity, exponential circuit complexity, machines that take advice, resulting arithmetic expression, checkable proof systems Key Phrases - Capitalized Phrases (CAPs): (learn more)
Proof Sketch, Polynomial-Time Hierarchy, Set Cover, Cobham-Edmonds Thesis, Bounded Non-halting, Computational Complexity, Expander Random Walk Generator, Graph Non-Isomorphism, Bounded Halting, Combining Theorem, Using Theorem, Halting Problem, Post Correspondence Problem, Rice's Theorem, Use the Probabilistic Method, Church-Turing Thesis, Extra Guideline, Arthur-Merlin Games, Chebyshev's Inequality, Motivating Remark Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
What Other Items Do Customers Buy After Viewing This Item?
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
