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

Partition Problem

Dividing a set of integers into two subsets with equal sums and proving NP-completeness.

This lesson is for subscribers

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