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 ...
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 ...
This project focused on researching the famous optimization problem: Subset Sum Problem. Subset Sum problem is easy to state and widely applicable. It is NP-Complete. Researchers have studied this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results