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
Therefore, Equation 6 can be replaced by: X
n
i=1 P=1+
xiai= y(t? 2s); 1 2
(13)
since ( n bi)? 2b0n 1= (0; 0;:::; 0; N (t? 2s)). i We now establish a bound on the size of jyj. From above,
jy(t? 2s)j= 2 If jt? 2sj 1 2
X
n
n n; where= max ai: i n 1
i=1
p
xiai (14) (15)
, then jyjjt? 2sj jyj, and
jyj 2npn;
by Equation 14. If jt? 2sj<, then we can solve two problems: one where is assumed to be part of the subset which sums to s, and one where is assumed to be part of the subset which sums to t? s. In the rst case, the new problem has s0= s?; t0= t?, and 1 2
jt0? 2s0j= jt?? 2s+ 2 j= jt? 2s+ j jt0? 2s0j= jt? 2s? j 1 2 1 2
1 2
:
(16) (17)
For the second case, the new problem has s0= s; t0= t?, and
:
and that the bound in Equation 15 holds. Thus we may always assume jt? 2sj We may now calculate the bound on probability P that there exists a vector x^ which satis es Equation 12. We now let x= (x;:::; xn) be any vector such that 2 x 2 Zn. We obtain the following bound, similar to Equation 10: 1
P Pr 1 2
X
n
i=1
aixi= y(t? 2s) 1 2=1 1 2
!
n
x: kxk
1 2
pn n 4npn+ 1: o
(18)
As in Section 2, Pr( n aixi= y(t? 2s)) 1=A. To estimate the number of vectors i pn, we again use the technique in 11, 14], but in a more complicated x with kxk way. The number of x with kxk pn=2 is bounded above by P n
w= (w;:::; wn): wi 2 Z for all i; kwk pn+ w= (w;:::; wn): wi 2 Z for all i; kw? (;;:::; )k 1 n 1 2 o 1 1 2 1 2 1 2
1 2
pn: (19) o
暂无评价 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 ...
热门文档