The difference between Grover’s algorithm and our first algorithm is that the Amplitude Amplification ratio in Grover’s algorithm is an arithmetic series and ours, a geometric one. Because our ...

Best-subset selection is a benchmark optimization problem in statistics and machine learning. Although many optimization strategies and algorithms have been proposed to solve this problem, our ...

A Python Implemented Cryptographic Algorithm Which Utilizes Public, Private Key Cryptography to Provide Congruent Super-Increasing Sets for Encryption of Data. This Algorithm relies on the SUBSET-SUM ...

I will describe an algorithm for the subset sum problem that runs in 2^{0.86n} time and uses polynomial pace. Previously, all algorithms with running time less than 2^n used exponential space, and ...