{
"item_title" : "Computational Complexity",
"item_author" : [" Sanjeev Arora", "Boaz Barak "],
"item_description" : "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.",
"item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/52/142/426/0521424267_b.jpg",
"price_data" : {
"retail_price" : "80.00", "online_price" : "80.00", "our_price" : "80.00", "club_price" : "80.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : ""
}
}
Overview
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.
This item is Non-Returnable
Customers Also Bought
Details
- ISBN-13: 9780521424264
- ISBN-10: 0521424267
- Publisher: Cambridge University Press
- Publish Date: April 2009
- Dimensions: 9.9 x 7.3 x 1.6 inches
- Shipping Weight: 2.7 pounds
- Page Count: 594
Related Categories
