{
"item_title" : "Computational Complexity",
"item_author" : [" Oded Goldreich "],
"item_description" : "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.",
"item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/52/188/473/052188473X_b.jpg",
"price_data" : {
"retail_price" : "104.00", "online_price" : "104.00", "our_price" : "104.00", "club_price" : "104.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Computational Complexity : A Conceptual Perspective
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780521884730
- ISBN-10: 052188473X
- Publisher: Cambridge University Press
- Publish Date: April 2008
- Dimensions: 10.13 x 7.02 x 1.6 inches
- Shipping Weight: 2.76 pounds
- Page Count: 632
Related Categories
