CS154 WEEK
Stanford course with 9 lecture notes.
Other Notes
- SU-CS154 Week 1
- SU-CS154 Week 10
- SU-CS154 Week 2
- SU-CS154 Week 3
- SU-CS154 Week 4
- SU-CS154 Week 5
- SU-CS154 Week 6
- SU-CS154 Week 8
- SU-CS154 Week 9
Key Topics Referenced
- Algorithmic Fairness
- Approximation Algorithms
- Church Turing Thesis
- Communication Complexity
- Conp
- Cook Levin Theorem
- Deterministic Finite Automata
- Mapping Reduction
- Mathematics
- Minimizing Dfas
- Myhill Nerode
- Nondeterministic Finite Automata
- Np Complete
- Oracle Polynomial Time
- Oracle Reduction
- Pumping Lemma
- Regular Expression Complexity
- Rice S Theorem
- Self Reference
- Space Complexity
- Streaming Algorithms
- There Are Non Recognizable Languages
- Turing Machine
- Universal Turing Machine