Solving subset sum problem by two different algorithms and comparing their peformance. The algorithms are referred from the following papers published in International Journal of Computer Applications ...

Sum of Subset problem is to find Subset of elements from a given Set whose Sum adds up to a given number K. Set Contains non-negative values. Input : Given Set , Subset, Size of Set & Subset , Total ...

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

We consider applications of Subset Product Problem (SPP) in number theory and cryptography. We obtain a probabilistic algorithm that attack SPP and we analyze it with respect time/space complexity and ...

Abstract: The minimal consistent subset selection is a solution of high computational demands problem of the nearest neighbor decision system. This paper presents a new approach that aims to make the ...