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

This project implements a Genetic Algorithm (GA) to solve the classical Subset Sum Problem (SSP). Instead of using brute-force techniques, it uses evolutionary principles like selection, crossover, ...

Algorithm Start the program. Take the number of elements n and the list of n integers as input, followed by the target sum x. Use combinations from the itertools library to generate all possible ...

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

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 of the ...