Computational Complexity: A Modern Approach
Overview & Synopsis
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a textbook. More than 300 exercises are included.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Computational Complexity: A Modern Approach |
|---|---|
| Author / Organization | Sanjeev Arora, Boaz Barak |
| Subject & Discipline | Computational Complexity, Algorithms and Data Structures, Computational and Algorithmic Mathematics, Parallel Computing and Programming |
| Categories | Computational Complexity |
| ISBN | 0521424267 |
| Resource Verification | ✓ Verified Direct PDF Available |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Reported File Size | 4146.6 KB (4,246,077 bytes) |
| Language | ENGLISH |
| Catalog ID | DOC-76514 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |
Commercial / Print Edition
Prefer a Physical Book or Kindle Edition?
Computational Complexity: A Modern Approach • Print Edition
As an Amazon Associate, MainReads earns from qualifying purchases.