Google, IBM & Meta Certificates – 40% Off
One Coursera Plus subscription covers most Professional Certificates on Coursera.
Unlock All Certificates
This lecture introduces polynomial-time complexity through the classes P and EXP, time hierarchy results, and concrete problems such as graph coloring, clique, paths, and longest common subsequence. It emphasizes brute-force solutions, running-time analysis, and polynomial-time algorithms.
