Np-complete

NP-Complete refers to the hardest known problems within the complexity class NP

Subset-sum

In computer science, the subset sum problem is one of the important problems in complexity theory and cryptography.

Others

Example |
---|

The subset-sum problem is from question Distinct sub sequences summing to given number in an array |