Name
Abstract | ||
|---|---|---|
It is well known that almost all subset sum problems with density less than 0.9408 ··· can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice. In this paper, the authors show that a similar result holds for the k-multiple subset sum problem which has k subset sum problems with exactly the same solution. Specially, for the single subset sum problem (k = 1), a modified lattice is introduced to make the proposed analysis much simpler and the bound for the success probability tighter than before. Moreover, some extended versions of the multiple subset sum problem are also considered. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/s11424-015-3324-9 | J. Systems Science & Complexity |
Keywords | Field | DocType |
Lattice, low-density, multiple modular subset sum problem, multiple subset sum problem | Partition problem,Discrete mathematics,Mathematical optimization,Subset sum problem,Combinatorics,Lattice (order),Oracle,Time complexity,Mathematics,Low density | Journal |
Volume | Issue | ISSN |
29 | 1 | 1559-7067 |
Citations | PageRank | References |
2 | 0.39 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yanbin Pan | 1 | 35 | 13.29 |
| feng zhao | 2 | 138 | 14.90 |