Arora. A Theorist's Toolkit. Princeton
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.
- from
- Theoretical Computer Science
- added
- 2026-10-10
- likes
- 0
similar
-
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.
-
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. 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…
-
O'Donnell. A Theorist's Toolkit. CMU cs.cmu.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.
-
Kelner. Topics in Theoretical Computer Science: An Algorithmist's Toolkit. MIT ocw.mit.edu
It covers a collection of geometric techniques that apply broadly in modern algorithm design.
-
Arora & Barak. Computational Complexity: A Modern Approach theory.cs.princeton.edu
A golden standard textbook, Surveying computational complexity theory for graduate students and researchers.
Theoretical Computer Science › TCS Toolkit > Lecture Notes: “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.”