EDN

Software snippet provides improved subset-sum algorithm

The subset-sum problem is one of the most frequently occurring NP (nondeterministic, polynomial-time)-complete) problems. It asks whether a subset of numbers in a set of positive integers adds up ...
GitHub

sum_of_subset.py

subset = [[False for i in range(requiredSum + 1)] for i in range(arrLen + 1)] # for each arr value, a sum of zero(0) can be formed by not taking any element ...
GitHub

Subset-Sum-algorithms (Brute Force vs. Dynamic Programming)

This repository provides an educational comparison of two fundamental approaches to solving the Subset Sum Problem: Brute Force (Exhaustive Search) and Dynamic Programming (DP). The subset sum problem ...
IEEE

An algorithm for subset sum problem on molecular computation

Abstract: DNA computing is a new emerging field of parallel computing. However, DNA computing is mainly based on biological technology, which is prone to deterioration and damage and other issues in ...
IEEE

An Efficient Arithmetic Optimization Algorithm for Solving Subset-sum Problem

Abstract: The Subset-Sum Problem (SSP) ensures a significant role in various practical applications, which include cryptography and coding theory owing to the importance in the functionality of some ...