Quantum algorithm and experimental demonstration for the subset sum problem

2021 ◽  
Vol 65 (8) ◽  
Author(s):  
Qilin Zheng ◽  
Pingyu Zhu ◽  
Shichuan Xue ◽  
Yang Wang ◽  
Chao Wu ◽  
...  
1990 ◽  
Vol 21 (2) ◽  
pp. 1-10
Author(s):  
Toshiro Tachibana ◽  
Hideo Nakano ◽  
Yoshiro Nakanishi ◽  
Mitsuru Nakao

2017 ◽  
Author(s):  
R U

All exact algorithms for solving subset sum problem (SUBSET\_SUM) are exponential (brute force, branch and bound search, dynamic programming which is pseudo-polynomial). To find the approximate solutions both a classical greedy algorithm and its improved variety, and different approximation schemes are used.This paper is an attempt to build another greedy algorithm by transferring representation of analytic geometry to such an object of discrete structure as a set. Set of size $n$ is identified with $n$-dimensional space with Euclidean metric, the subset-sum is identified with (hyper)plane.


Sign in / Sign up

Export Citation Format

Share Document