RSS Amplifier

Video feed

Graduate 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.

Toda's 1st Theorem and the Permanent: Graduate Complexity Lecture 14 at CMU

Play

Valiant--Vazirani Theorem, and Exact Counting (#P): Graduate Complexity Lecture 13 at CMU

Play

Approximate counting: Graduate Complexity Lecture 12 at CMU

Play

More on constant-round interactive proof systems: Graduate Complexity Lecture 12 at CMU

Play

Introduction to Arthur-Merlin classes, MA and AM: Graduate Complexity Lecture 10 at CMU

Play

Time/Space Tradeoffs for SAT: Graduate Complexity Lecture 9 at CMU

Play

Improving Kannan's Theorem: Graduate Complexity Lecture 8 bonus material at CMU

Play

Oracles, and the Polynomial Time Hierarchy vs. circuits: Graduate Complexity Lecture 8 at CMU

Play

The Polynomial Time Hierarchy: Graduate Complexity Lecture 7 at CMU

Play

Quasilinear Cook--Levin Theorem: Graduate Complexity Lecture 6 at CMU

Play

Probabilistic Complexity Classes: Graduate Complexity Lecture 5 at CMU

Course Introduction and Overview: Graduate Complexity Lecture 1 at CMU

Hierarchy Theorems (Time, Space, and Nondeterministic): Graduate Complexity Lecture 2 at CMU

Hopcroft--Paul--Valiant Theorem: Graduate Complexity Lecture 3 at CMU

Circuits: Graduate Complexity Lecture 4 at CMU