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

The mission of this repository is to become a high-quality, community-curated resource for learning fundamental algorithms and data structures. While we enthusiastically participate in events like ...

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

In seeking out an algorithm to test out the capability of the IBM Quantum Experience quantum computer, we were given a review paper covering various algorithms for solving the subset-sum problem, ...

Abstract: Quantum walk-based search algorithms have demonstrated an asymptotic quadratic speedup compared to classical search methods. Formulating a generic search problem as a (quantum) search over a ...