Lecture 14: P and NP, SAT, Poly-Time Reducibility

Name: Lecture 14: P and NP, SAT, Poly-Time Reducibility
Uploaded: 2021-10-06T12:45:48Z
Duration: 1 h 19 min 23 s
Description: Description: Quickly reviewed last lecture. Defined NTIME\((t(n))\) complexity classes and the class NP. Showed \(COMPOSITES\) ∈ NP. Discussed the P versus NP question. Proved \(A\) CFG ∈ P. Introduced the satisfiability problem \(SAT\) and polynomial-time reducibility. Instructor: Prof. Michael Sipser

1:19:23

Description: Quickly reviewed last lecture. Defined NTIME\((t(n))\) complexity classes and the class NP. Showed \(COMPOSITES\) ∈ NP. Discussed the P versus NP question. Proved \(A\)_CFG ∈ P. Introduced the satisfiability problem \(SAT\) and polynomial-time reducibility.

Instructor: Prof. Michael Sipser