This book "Computational complexity: A modern approach" aims to describe such recent achievements of complexity theory in the context of more classical results. It is intended to both serve as a textbook and as a reference for self-study. Part 1 of book provide students with knowledge about: lower bounds for concrete computational models; advanced topics; communication complexity; algebraic computation models; hardness amplification and error correcting codes; proofs of PCP theorems and the Fourier transform technique; . |
