GitHub

stav-rones/subset-sum

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 ...
INSPIRE

Solving Subset Sum Problems using Quantum Inspired Optimization Algorithms with Applications in Auditing and Financial Data Analysis

Many applications in automated auditing and the analysis and consistency check of financial documents can be formulated in part as the subset sum problem: Given a set of numbers and a target sum, find ...
IEEE

Robustness Analysis of Zero-Knowledge Proofs Technique using Subset Sum Problem

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 ...
IEEE

On the Variants of Subset Sum: Projected and Unbounded

Abstract: In this work, we focus on variants of Subset Sum. We first define a new variant called the Unique Projection Subset Sum (u – PSSUM) problem: Given $\left ...