Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is ll 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. , 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.
['Yanbin Pan', 'Feng Zhang']
I am writing a research paper on a idea Solving low-density multiple subset sum problems with SVP oracle
[{"from": "human", "value": "I am writing a research paper on a idea Solving low-density multiple subset sum problems with SVP oracle"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: It is ll known that almost all subset sum problems with density less than 0.9408 \u00b7\u00b7\u00b7 can be solved in polynomial time with an SVP oracle that can find a shortest vector in a special lattice. , 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."}]