Foundations of Computer Science¶
This document was built on Jan 23, 2021.
- The Potential Method
- Divide and Conquer
- Dynamic Programming
- Greedy Algorithms
- Introduction to Computability
- The Halting Problem
- Computable Functions and Kolmogorov Complexity
- Rice’s Theorem
- Introduction to Complexity
- The Cook-Levin Theorem
- Search and Approximation
This text was originally written for EECS 376, the Foundations of Computer Science course at the University of Michigan, by Amir Kamil in Fall 2020. This is version 0.1-alpha of the text.
This text is licensed under the Creative Commons Attribution-ShareAlike 4.0 International license.