The journal
Open the journal →The conversation starts in the journal — be the first to post.
About subset sum problem
The subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset of integers and a target-sum , and the question is to decide whether any subset of the integers sum to precisely . The problem is known to be NP-complete. Moreover, some restricted variants of it are NP-complete too, for example:The variant in which all inputs are positive.
Everything about subset sum problem →