Course contentsShow
Computer Science
Lesson 1932 of 2,87243. Complexity TheoryPro lesson

Proving NP-Completeness via Reduction

Learn the standard technique for proving a problem is NP-complete by reducing from a known NP-complete problem.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.