Computational Complexity A Modern Approach

ISBN-10: 0521424267

ISBN-13: 9780521424264

Edition: 2009

List price: $97.95 Buy it from $61.62
eBook available
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

Description:

New Starting from $61.62
eBooks Starting from $48.00
Buy eBooks
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
Study Briefs

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.

Add to cart
Study Briefs
Medical Terminology Online content $4.95 $1.99
Add to cart
Study Briefs
Medical Math Online content $4.95 $1.99
Customers also bought
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $97.95
Copyright year: 2009
Publisher: Cambridge University Press
Publication date: 4/20/2009
Binding: Hardcover
Pages: 594
Size: 7.00" wide x 10.00" long x 1.25" tall
Weight: 2.926
Language: English

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
Diagonalization
Space complexity
The polynomial hierarchy and alternations
Boolean circuits
Randomized computation
Interactive proofs
Cryptography
Quantum computation
PCP theorem and hardness of approximation: an introduction
Lower Bounds for Concrete Computational Models
Decision trees
Communication complexity
Circuit lower bounds
Proof complexity
Algebraic computation models
Advanced Topics
Complexity of counting
Average case complexity: Levin's theory
Hardness amplification and error correcting codes
Derandomization
Pseudorandom constructions: expanders and extractors
Proofs of PCP theorems and the Fourier transform technique
Why are circuit lower bounds so difficult?
mathematical background
×
Free shipping on orders over $35*

*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.

Learn more about the TextbookRush Marketplace.

×