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
section derives the 0:6463::: bound using simpler techniques due to Frieze 7]. Our presentation di ers from that of 7] in a few technical details. Let A be a positive integer and let a;:::; an be random integers with 0< ai A for 1 i n. Let e= (e;:::; en) 2 f0; 1gn, e 6= (0; 0;:::; 0) depending only on n, be xed and let 1 1
s=
X
n
i=1
eiai;
t=
X
n
i=1
ai:
We may assume that s t=n, since if s< t=n any ai t=n cannot be in the subset, and may be removed from consideration. Similarly, s (1? (1=n))t, otherwise any ai (1? (1=n))t may be removed from consideration. Thus, 1 t s n? 1 t: (3) We recall the Lagarias-Odlyzko attack on low-density subset sum problems. De ne the vectors b1;:::; bn 1 as follows: +
n
n
. . . bn= (0; 0;:::; 1; Nan); bn 1= (0; 0;:::; 0; Ns); +
b1= (1; 0;:::; 0; Na ); b2= (0; 1;:::; 0; Na ); 1 2
where N is a positive integer which will be chosen later. Let L be the lattice spanned by the vectors b1;:::; bn 1 (i.e. L= f n zibi: zi 2 Z for 1 i n+ 1g). i Notice that the solution vector^= (e;:::; en; 0) is in L. Following the proof in e 7] we are interested in vectors x= (x; x;:::; xn ) which satisfy:^ P++1=1 1 1 2+1
kxk k^k;^ e x 2 L;^ x 62 f0;^;?^g:^ e e We may assume that X
(4)
n
i=1
ei
1 2
n; P=1 1 2 1 2
(5)
(i.e. the subset contains at most one-half of the ai's). If n ei> n, we may replace s i 0= (0;:::; 0; N (t? s)), and^ by^0= (1? e; 1? e;:::; 1? en; 0). by t? s, bn 1 by bn 1 e e ++
暂无评价 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 ...
热门文档