Welcome to IOU Digital Library

A comprehensive, graduate-level textbook presenting modern approaches to computational complexity. It covers core topics such as time and space complexity, probabilistic and nondeterministic computation, interactive proofs, approximation algorithms, hardness of approximation, PCP theorem, and advanced techniques — serving as a foundational text for researchers and advanced students in theoretical computer science.

no reviews

245: $a: Computational Complexity: A Modern Approach
245: $b:
082: $a:
100: $a: Sanjeev Arora & Boaz Barak
650: $a: Computational complexity theory
250: $a:
440: $v:
250: $b: Cambridge University Press
250: $c: 2009
020: $a: 978-0-521-42426-4
300: $a: 819