RSS Amplifier

Video feed

Undergrad Complexity Theory at CMU

youtube.com ↗Source feed ↗15 videos

Subscribe:.rss.atom.json.md

Dormant Last read · last published · next check
Read 1 day ago and current, but nothing has been published for 9 years.

Written by

Latest videos

Saves to your Watch queue, to pick up on another day or another device.

Undergrad Complexity at CMU - Lecture 15: coNP

Play

Undergrad Complexity at CMU - Lecture 14: Ladner's Theorem and Mahaney's Theorem

Play

Undergrad Complexity at CMU - Lecture 13: Search-to-Decision, Padding, Dichotomy Theorems

Play

Undergrad Complexity at CMU - Lecture 12: NP-Completeness Reductions

Play

Undergrad Complexity at CMU - Lecture 11: NP-Completeness and the Cook--Levin Theorem

Play

Undergrad Complexity at CMU - Lecture 10: Reductions

Play

Undergrad Complexity at CMU - Lecture 9: Nondeterminism

Play

Undergrad Complexity at CMU - Lecture 8: NP

Play

Undergrad Complexity at CMU - Lecture 7: SAT

Play

Undergrad Complexity at CMU - Lecture 6: Problems in P

Play

Undergrad Complexity at CMU - Lecture 5: Time Hierarchy Theorem

Undergrad Complexity at CMU - Lecture 4: Time Complexity and Universal Turing Machines

Undergrad Complexity at CMU - Lecture 3: Simulations and Turing Machine Variants

Undergrad Complexity at CMU - Lecture 2: Turing Machines

Undergrad Complexity at CMU - Lecture 1: Course Overview