On the subset sum problem for finite fields

2021 ◽  
Vol 76 ◽  
pp. 101912
Author(s):  
Marco Pavone
2008 ◽  
Vol 14 (4) ◽  
pp. 911-929 ◽  
Author(s):  
Jiyou Li ◽  
Daqing Wan

2018 ◽  
Vol 51 ◽  
pp. 204-217 ◽  
Author(s):  
Weiqiong Wang ◽  
Jennifer Nguyen

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