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
k^k= kek:) First we estimate the probability P by e P Pr(9 x; y s.t. kxk kek; jyj n n; x 62 f0; e;?eg; 1 2 q
X
n
Pr
X
n
i=1
xiai= ys); !
jfx: kxk kekgj
i=1
aixi= ys: 0< kxk kek; jyj n n; x 62 f0; e;?eg 1 2
q
y: jyj n n: 1 2 P=1
q
(10)
We have to estimate three factors in the right side of Equation 10. For the rst factor of Equation 10 we may rewrite n aixi= ys as: i n X i=1
aizi= 0; where zi= xi? yei: 1
Since x is non-zero and kxk kek, we have z= (z;:::; zn) 6= 0, and so we may assume without loss of generality (by increasing the bound for the probability by a factor of at most n) that z 6= 0. If z0 is de ned as?( n aizi=z ), then i P 1=2 1
Pr
X
n
i=1
aizi= 0= Pr(a= z0); 1
!
===
X
A
j=1 A X j=1 A X
Pr(a= z0jz0= j ) Pr(z0= j ); 1
Pr(a= z0) Pr(z0= j ); (a and j are independent); 1 1
j=1 A
1 Pr(z0= j );
Now we consider the second factor of Equation 10. From 11] (which borrowed the technique from 14]) we know that
A
1:
jfx: kxk kekgj
x: kxk
q
1 2
n
2c0 n; where c= 1:54724::: (11) 0 q 1 2
It is clear that the last factor of Equation 10 can be estimated by 2n This proves Equation 9.
n+ 1.
3. A new, improved bound on the density The main result of this note is an improvement in the maximum density of subset sum problems which can\almost always" be solved:
暂无评价 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 ...
热门文档