Lecture 22: Provably Intractable Problems, Oracles

Name: Lecture 22: Provably Intractable Problems, Oracles
Uploaded: 2021-10-06T12:44:33Z
Duration: 1 h 22 min 50 s
Description: Description: Quickly reviewed last lecture. Introduced exponential complexity classes and demonstrated a “natural” provably intractable problem. Introduced oracles and relativized computation to suggest that pure diagonalization-based methods cannot separate P and NP. Instructor: Prof. Michael Sipser

1:22:50

Description: Quickly reviewed last lecture. Introduced exponential complexity classes and demonstrated a “natural” provably intractable problem. Introduced oracles and relativized computation to suggest that pure diagonalization-based methods cannot separate P and NP.

Instructor: Prof. Michael Sipser