---
title: "CS 254: Computational Complexity"
type: course-overview
source-count: 16
status: active
confidence: high
---

# CS 254: Computational Complexity

Stanford course with 16 lecture notes.

## Lecture Timeline

- **2025-01-06** — [SU-CS254 JAN062025](../raw/course/cs254/kbhsu_cs254_jan062025.md)
- **2025-01-08** — [SU-CS254 JAN082025](../raw/course/cs254/kbhsu_cs254_jan082025.md)
- **2025-01-15** — [SU-CS254 JAN152025](../raw/course/cs254/kbhsu_cs254_jan152025.md)
- **2025-01-22** — [SU-CS254 JAN222025](../raw/course/cs254/kbhsu_cs254_jan222025.md)
- **2025-01-27** — [SU-CS254 JAN272025](../raw/course/cs254/kbhsu_cs254_jan272025.md)
- **2025-01-29** — [SU-CS254 JAN292025](../raw/course/cs254/kbhsu_cs254_jan292025.md)
- **2025-02-03** — [SU-CS254 FEB032025](../raw/course/cs254/kbhsu_cs254_feb032025.md)
- **2025-02-05** — [SU-CS254 FEB052025](../raw/course/cs254/kbhsu_cs254_feb052025.md)
- **2025-02-10** — [SU-CS254 FEB102025](../raw/course/cs254/kbhsu_cs254_feb102025.md)
- **2025-02-12** — [SU-CS254 FEB122025](../raw/course/cs254/kbhsu_cs254_feb122025.md)
- **2025-02-19** — [SU-CS254 FEB192025](../raw/course/cs254/kbhsu_cs254_feb192025.md)
- **2025-02-24** — [SU-CS254 FEB242025](../raw/course/cs254/kbhsu_cs254_feb242025.md)
- **2025-02-26** — [SU-CS254 FEB262025](../raw/course/cs254/kbhsu_cs254_feb262025.md)
- **2025-03-03** — [SU-CS254 MAR032025](../raw/course/cs254/kbhsu_cs254_mar032025.md)
- **2025-03-05** — [SU-CS254 MAR052025](../raw/course/cs254/kbhsu_cs254_mar052025.md)

## Other Notes

- [SU-CS254 JAN132025](../raw/course/cs254/kbhsu_cs254_jan1032025.md)

## Key Topics Referenced

- [[A Library Of Languages]]
- [[Bpp Subset P Poly]]
- [[Certificates Based Intepretation Of Nl]]
- [[Circuits]]
- [[Computational Task]]
- [[Conl]]
- [[Conp]]
- [[Cook Levin Theorem]]
- [[Extended Church Turing Thesis]]
- [[Graph Isomorphism Is In Np]]
- [[Interactive Proof]]
- [[Nl]]
- [[Non Deterministic Computation]]
- [[Non Deterministic Space]]
- [[Non Polynomial Time]]
- [[Np Intersect Conp]]
- [[Polynomial Hierarchy]]
- [[Proof Of Nl Conl]]
- [[Randomized Turing Machine]]
- [[Randomness]]
- [[Sat Is In Np]]
- [[Space Class L]]
- [[Space Complexity]]
- [[Space Time Hierachy]]
- [[Stconn]]
- [[Su Cs254 Feb262025]]
- [[Theory Of Computing]]
- [[Time Complexity]]
- [[Turing Machinea]]
- [[Universal Hash Family]]

