Topic · undergrad complexity cmu
undergrad complexity cmu
The 10 most recent episodes and tracks on this topic.
Saves to your Watch queue, to pick up on another day or another device.
Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.
- Undergrad Complexity at CMU - Lecture 15: coNPUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 14: Ladner's Theorem and Mahaney's TheoremUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 13: Search-to-Decision, Padding, Dichotomy TheoremsUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 12: NP-Completeness ReductionsUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 11: NP-Completeness and the Cook--Levin TheoremUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 10: ReductionsUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 9: NondeterminismUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 8: NPUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 7: SATUndergrad Complexity Theory at CMUNotes
- Undergrad Complexity at CMU - Lecture 6: Problems in PUndergrad Complexity Theory at CMUNotes
This playlist:.m3u.plsAll the feeds behind it
