Subset Sum and Partition are NP-complete - Complexity Theory - Design and Analysis of Algorithms

Описание к видео Subset Sum and Partition are NP-complete - Complexity Theory - Design and Analysis of Algorithms

In this video I give reductions between Subset Sum and Partition (and vice versa) to show they are equivalent in complexity and are both members of NP-complete.

Комментарии

Информация по комментариям в разработке