The Subset-sum Problem is one of the easiest to describe and understand NP-complete problems. Available algorithms that solve this problem exactly need an exponential time, thus finding a solution to ...

Problem Statement:-Sum of Subset problem using Dynamic Programming approach and demonstrate any two applications in the form of test cases. Theory:- An array a[ ] is given with size 'n'. Sum of Subset ...

To solve the subset sum problem, a well-known nondeterministic polynomial-time complete problem that is widely used in encryption and resource scheduling, we propose a feasible quantum algorithm that ...