4.8. The Subset Sum Problem
In this section, we assume that 
be a knapsack set. For 
, we are required to find out 
such that 
, provided that a solution exists. In general, finding such a solution for ∊1, . . . , ∊n is a very difficult problem.[6] However, if the weights satisfy some specific bounds, there exist polynomial-time algorithms for solving ...
Get Public-key Cryptography: Theory and Practice now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
