Computational Complexity A Modern Approach
List price: $97.95
Buy it from $39.65
This item qualifies for FREE shipping
*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $97.95
Copyright year: 2009
Publisher: Cambridge University Press
Publication date: 4/20/2009
Size: 7.00" wide x 10.00" long x 1.25" tall
Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.
|Basic Complexity Classes|
|The computational model - and why it doesn't matter|
|NP and NP completeness|
|The polynomial hierarchy and alternations|
|PCP theorem and hardness of approximation: an introduction|
|Lower Bounds for Concrete Computational Models|
|Circuit lower bounds|
|Algebraic computation models|
|Complexity of counting|
|Average case complexity: Levin's theory|
|Hardness amplification and error correcting codes|
|Pseudorandom constructions: expanders and extractors|
|Proofs of PCP theorems and the Fourier transform technique|
|Why are circuit lower bounds so difficult?|