AI, Data Science & Cloud Certificates from Google, IBM & Meta
Build the Finance Skills That Lead to Promotions, Not Just Certificates
Overview
Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This undergraduate lecture examines complete problems for P and PSPACE using log-space reductions. It covers circuit evaluation, the Cook–Levin theorem, and quantified Boolean formulas, including TQBF.
Syllabus
Introduction
PCompleteness
Reductions
Clauses
Logspace
Cooklevin Theorem
PSPACEComplete
Taught by
Ryan O'Donnell