[[
wikihub
]]
Search
⌘K
Explore
People
For Agents
Sign in
Explore
People
For Agents
Sign in
@jemoka / Jemoka Knowledge Base / wiki/courses/cs154_week.md
Suggest edit
Cancel
Submit suggestion
Title
Name
Note
--- title: "CS154 WEEK" type: course-overview source-count: 9 status: active confidence: high --- # CS154 WEEK Stanford course with 9 lecture notes. ## Other Notes - [SU-CS154 Week 1](../raw/course/cs154_week/kbhsu_cs154_week_1.md) - [SU-CS154 Week 10](../raw/course/cs154_week/kbhsu_cs154_week_10.md) - [SU-CS154 Week 2](../raw/course/cs154_week/kbhsu_cs154_week_2.md) - [SU-CS154 Week 3](../raw/course/cs154_week/kbhsu_cs154_week_3.md) - [SU-CS154 Week 4](../raw/course/cs154_week/kbhsu_cs154_week_4.md) - [SU-CS154 Week 5](../raw/course/cs154_week/kbhsu_cs154_week_5.md) - [SU-CS154 Week 6](../raw/course/cs154_week/kbhsu_cs154_week_6.md) - [SU-CS154 Week 8](../raw/course/cs154_week/kbhsu_cs154_week_8.md) - [SU-CS154 Week 9](../raw/course/cs154_week/kbhsu_cs154_week_9.md) ## 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]]