The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on bas
In 14] it is shown that for n su ciently large, the second summand in Equation 19 above is smaller than the rst summand by a factor that is exponential in n. In any case, the second summand equals 2n . By the method of 11, 14], the rst summand is bounded, for every u> 0, by 2 where (u)= u+ ln (e?u ); for (z)= 1+ 2 1 4 (log2 ) ( )
e u n;
X
1
k=1
z k2:
Numerically, we may calculate the minimum value of (u), and obtain (u) n
(u )= 0:7367:::; 0
for u= 1:8132::: 0
Thus, for large n, we have
polynomial time, given the existence of a lattice oracle.
c0 n p P n 4n n+ 1 2A: Thus, any subset sum problem with density d< 1=c0= 0:9408::: may be solved in 0
x: kxk
1 2
pn
o
2c0 n; 0
for c0= 1:0628:::; 0
0
4. Discussion The analysis above shows that it is possible to improve t
he density bound from 0:6463::: to 0:9408::: by modifying one vector in the lattice basis. We now consider the possibilities of improving on this bound. Solving subset sum problems with basis reduction is closely connected to lattice covering problems. In particular, we want to cover the vertices of the n-cube (representing the possible e solution vectors) with a polynomial number of n-spheres of p radius n. Lagarias and Odlyzko showed that it was possible to cover the n-cube with two n-spheres of radius n. The two spheres (centered at (0; 0;:::; 0) and (1; 1;:::; 1)) correspond to the two basis reduction problems which must be solved for any given subset sum problem. Our analysis above uses one n-sphere of radius pn centered at (;;:::; ) to cover all the points. One way to improve the bound presented above would be to show that it is possible to cover the vertices of the n-cube with a polynomial number of n-spheres of radius q 1 2 1 2 1 2 1 2 1 2
暂无评价 14页 免费 Improved low-density sub... 暂无评价 18页 免费搜...Branching proofs of infeasibility in low density subset sum problems G?bor ...
M. Odlyzko, “Solving low-density Subset Sum problems“, J. Assoc. Comp...Euchner M., “Lattice Basis Reduction: Improved Practical Algorithms and ...
M. Odlyzko, “Solving low-density Subset Sum problems“, J. Assoc. Comp...Euchner M., “Lattice Basis Reduction: Improved Practical Algorithms and ...
Improved low-density subset sum algorithms[J]. Computational Complexity,1992,2(2): 111-128. [11] 于志强, 罗世新, 徐树民等.对一个公钥密码体制的格...
subset_sum_problem_计算机软件及应用_IT/计算机_专业资料。CS 105: Algorithms (Grad) Subset Sum Problem Soumendra Nanda March 2, 2005 1 What is the Subset...
improved low ? density subset sum algorithms[j]. computational complexity, 1992, 2(2): 111-128. ?[3] odlyzko a m. the rise and fall of knapsack ...
Stern. Improved Low-density Subset Sum Algorithms. Computational Complexity, 2:111–128, 1992. CosterLaMacchiaOdlyzkoea:91 . . . . . . . . . . ....
7页 免费 Improved low-density sub... 暂无评价 14页 免费喜欢此文档的还喜欢...Subset-sum Problem- and other balanced knapsack algorithms An O(nr) algori...
Improved low-density sub... 暂无评价 14页 免费 Improved low-density sub....algorithm for the Subset-sum Problem and other balanced knapsack algorithms ...
Afterwards, similar problems turned up in -4- connection with an algorithm for solving low-density subset-sum problems [9], where a crucial role in ...
热门文档