Arora & Barak. Computational Complexity: A Modern Approach
A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
Goldreich. Computational Complexity: A Conceptual Perspective wisdom.weizmann.ac.il
A grad introduction to computation complexity theory, emphasizing the idea behind concepts of complexity theory.
-
Arora. The Computational Universe cs.princeton.edu
Takes us on a broad sweep of scientific knowledge and related technologies: propositional logic of the ancient Greeks (microprocessors); quantum mechanics (silicon chips); network and system phenomena (internet and search engines); computational intractability (secure…
-
Arora. Advanced Algorithm Design cs.princeton.edu
Notably uses ideas such as randomness, approximation, high dimensional geometry. Faces uncertainty, approaches to handle big data, handling intractability, heuristic approaches, ..etc.
-
Arora. A Theorist's Toolkit. Princeton cs.princeton.edu
Aimed primarily at first and second year graduate students who plan to do research in theoretical computer science. We will introduce probabilistic, algebraic, combinatorial, and algorithmic methods useful in proofs.
-
Arora. Thinking Like a Theorist. Princeton cs.princeton.edu
It covers a large number of the math/CS topics that you need to know for reading and doing research in Computer Science Theory.
-
Rudich & Wigderson. Computational Complexity Theory ams.org
Three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. Topics include reductions, lower-bounds, average-case complexity, randomness, interactive proof systems, probabilistically checkable proofs, quantum computing, and…
Theoretical Computer Science › Computational Complexity > Introductory > Books: “A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.”