A golden standard textbook, Surveying computational complexity theory for graduate students and researchers
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.
An accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory
Body of knowledge for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the structural aspects of the P=NP question, parallel computation, and the polynomial hierarchy
A very gentle introduction to some fundamental ideas of computational complexity like NP-completeness and P vs NP
A grad introduction to computation complexity theory, emphasizing the idea behind concepts of complexity theory