Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture proves the Immerman–Szelepcsényi theorem, showing that nondeterministic log-space is closed under complement. It develops certificates for graph non-reachability and connects the result to polynomial-space completeness and reductions.
