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
Solving this problem is equivalent to solving the given problem, n (1? ei) n, i 0= t? s t=n. (To be fully rigorous, we actually apply the basic method to and s two problems, at least one of which is covered by the condition n ei n, and our i analysis below applies to this case.) p x Choose N> n. It is clear that^ satis es Equation 4 only if xn= 0. (Othpn k^k, which
contradicts Equation 4.) Let y be erwise, kxk jxn j N>^ e de ned by P=1 1 2 P=1 1 2+1+1
ys= and deduce that
X
n
i=1
xiai; X
(6) q
jyjs=
X
n
i=1
xiai
kxk^ q
n
i=1
ai
t n: 1 2
(7)
Hence, using Equation 3 above,
jyj n n: 1 2+1
(8)
Note that since?y is the coe cient of bn in the expansion of x in terms of the^ basis vectors, y 2 Z. We will show that the probability P| that a lattice L contains a short vector which satis es Equation 4| is:
This implies that, if A= 2cn with c> c, nlim P= 0. If the density of a subset sum !1 problem is less than 0:6463:::, then 0
P= Pr(9 x which satis es Equation 4)^ c0 n n 2n n+ 1 2A; for c= 1:54724::: q 1 2 0
(9)
n=: i n log max ai< 0:6463:::=) max ai> 2 i n=) A> 2c0 n: 2 1 1
n
0 6463
:::
Thus, all subset sum problems with density< 0:6463::: could be solved in polynomial time, given the existence of a lattice oracle. We will now prove Equation 9. Let x= (x;:::; xn) denote an element of Zn. (Note that if x= (x;:::; xn; 0), then kxk= kxk and as a special case we have^^ 1 1
暂无评价 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 ...
热门文档