The bounded subset sum problem is almost everywhere randomly decidable in O(n)

1986 ◽  
Vol 23 (1) ◽  
pp. 11-17 ◽  
Author(s):  
G. Tinhofer ◽  
H. Schreck
Keyword(s):  
Bounded Subset ◽  
Subset Sum Problem ◽  
Almost Everywhere ◽  
Subset Sum

An Algorithm Using Modular Arithmetic for the Subset Sum Problem

1990 ◽  
Vol 21 (2) ◽  
pp. 1-10
Author(s):  
Toshiro Tachibana ◽  
Hideo Nakano ◽  
Yoshiro Nakanishi ◽  
Mitsuru Nakao
Keyword(s):  
Modular Arithmetic ◽  
Subset Sum Problem ◽  
Subset Sum

scholarly journals Trivial geometric heuristic for subset sum problem

2017 ◽  
Author(s):  
R U
Keyword(s):  
Greedy Algorithm ◽  
Dimensional Space ◽  
Approximate Solutions ◽  
Exact Algorithms ◽  
Approximation Schemes ◽  
Brute Force ◽  
Discrete Structure ◽  
Subset Sum Problem ◽  
Subset Sum ◽  
Hyper Plane

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.

Brief Announcement: On the Fair Subset Sum Problem

2015 ◽  
pp. 309-311
Author(s):  
Gaia Nicosia ◽  
Andrea Pacifici ◽  
Ulrich Pferschy
Keyword(s):  
Subset Sum Problem ◽  
Subset Sum
Sign in / Sign up

Export Citation Format

Share Document