Undergrad Complexity at CMU - Lecture 1: Course Overview01:19:32 › 1 year ago |

10^500 Parallel Universes: Lecture 1 of Quantum Computation and Information at CMU01:08:48 › 6 months ago |

Course Introduction and Overview: Graduate Complexity Lecture 1 at CMU01:20:23 › 1 year ago |

Undergrad Complexity at CMU - Lecture 23: The Polynomial Hierarchy01:17:40 › 1 year ago |

Undergrad Complexity at CMU - Lecture 25: Interactive Proofs: IP=PSPACE01:23:37 › 1 year ago |

Hopcroft--Paul--Valiant Theorem: Graduate Complexity Lecture 3 at CMU01:20:29 › 1 year ago |

Great Ideas in Theoretical Computer Science: Introduction (Spring 2016)01:12:46 › 1 year ago |

Undergrad Complexity at CMU - Lecture 5: Time Hierarchy Theorem01:20:50 › 1 year ago |

Circuits: Graduate Complexity Lecture 4 at CMU01:19:50 › 1 year ago |

Undergrad Complexity at CMU - Lecture 9: Nondeterminism01:21:02 › 1 year ago |

Undergrad Complexity at CMU - Lecture 3: Simulations and Turing Machine Variants01:20:14 › 1 year ago |

Understanding and Measuring One Qubit: Lecture 3 of Quantum Computation and Information at CMU01:21:29 › 6 months ago |

Analysis of Boolean Functions at CMU - Lecture 1: The Fourier expansion and basic formulas01:11:25 › 1 year ago |

Rotate, Compute, Rotate: Lecture 2 of Quantum Computation and Information at CMU01:20:24 › 6 months ago |

Great Ideas in Theoretical Computer Science: Gödel's Incompleteness Theorems (Spring 2013)01:09:59 › 1 year ago |

Hierarchy Theorems (Time, Space, and Nondeterministic): Graduate Complexity Lecture 2 at CMU01:21:06 › 1 year ago |

Undergrad Complexity at CMU - Lecture 15: coNP01:21:29 › 1 year ago |

Undergrad Complexity at CMU - Lecture 17: Savitch's Theorem and NL01:21:12 › 1 year ago |

Undergrad Complexity at CMU - Lecture 14: Ladner's Theorem and Mahaney's Theorem01:22:37 › 1 year ago |

All Rights Reserved.