20. L and NL, NL = coNL

MIT 18.404J Theory of Computation, Fall 2020
Instructor: Michael Sipser
View the complete course: ❤️情人节美甲💅教程#20nails://ocw.mit.edu/18-404JF20
YouTube Playlist: ❤️情人节美甲💅教程#20nails://www.youtube.com/playlist?list=PLUl4u3cNGP60_JNv2MmK3wkOt9syvfQWY

Reviewed log space: NL is a subset of SPACE(log^2n) and NL is a subset of P. Introduced log-space transducers and log-space reducibility. Defined NL-completeness. Proved that PATH is NL-complete. Also proved the Immerman-Szelepcsényi theorem: NL = coNL.

执照: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ

We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.