Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This graduate lecture introduces the polynomial-time hierarchy in computational complexity theory. It develops quantified-circuit and alternating-machine definitions, examines complexity classes and collapse questions, and relates the hierarchy to P versus NP.
