Subset Sum is a nondeterministic polynomial-time complete (NP-C) combinatorial optimization problem, meaning that it is a finite set problem proven to be in the family of problems that are ...
Abstract: Given a multiset of n positive integers and a target sum S, the subset sum problem is to find a subset such that the sum of its elements is as close as possible to S without exceeding S. We ...
Abstract: In this paper, security mechanism called zero knowledge proofs has been defined using subset sum problem. We have used subset sum problem for robustness analysis of zero-knowledge proofs ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback