Lecture 20: L and NL, NL = coNL

Name: Lecture 20: L and NL, NL = coNL
Uploaded: 2021-10-06T12:45:34Z
Duration: 1 h 20 min 6 s
Description: Description: Reviewed \(\log\) space: NL ⊆ SPACE\((\log^2n)\) and NL ⊆ P. Introduced log-space transducers and log-space reducibility. Defined NL-completeness. Proved that \(PATH\) is NL-complete and \(\overline{2SAT}\) is NL-complete. Proved the Immerman-Szelepcsényi theorem: NL = coNL. Instructor: Prof. Michael Sipser

1:20:06

Description: Reviewed \(\log\) space: NL ⊆ SPACE\((\log^2n)\) and NL ⊆ P. Introduced log-space transducers and log-space reducibility. Defined NL-completeness. Proved that \(PATH\) is NL-complete and \(\overline{2SAT}\) is NL-complete. Proved the Immerman-Szelepcsényi theorem: NL = coNL.

Instructor: Prof. Michael Sipser