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
0:9408::: cannot be improved in this way. The following proposition shows that any n-sphere of radius p n with< can cover only an exponentially small fraction of the vertices of the n-cube. Thus, no polynomial collection of such spheres can satisfy our requirements. 1 4
p n with< . We show that this is not possible, and that the asymptotic bound of 1 4
Proposition. Any sphere of radius p n;<, in Rn contains at most (2? )n points of f0; 1gn, for some= ( )> 0. 1 4 1 2
Proof. Suppose that the n-sphere is centered at the point c= (c;:::; cn ). We are interested in the number of points e 2 f0; 1gn for which kc? ek n. Using the upper bound technique of 14], we show that N, the number of points in f0; 1gn inside the sphere, is bounded by
N e 1
n n Y (e?c2 i i=1
+ e? c? 2 ): ( i
1)
(20) 2 P=1 2
If the point e= (e;:::; en) is inside the sphere, then kc? ek= n (ci? ei) i and after expanding the right side, Equation 20 contains a term of the form exp
n,
n? (ci? ei) X
n
!
2
for each such point e, which proves Equation 20 since all terms in the expansion are nonnegative. Since the terms in the product in Equation 20 are independent, we know that the value of N is bounded by
i=1
1;
e n max c2R n
Y
n
i=1
e?c2+ e? c? i
(
i
1)2
e n(2e?= )n: 1 4 ( 1) 1 4
(It is easy to show that the maximum value of f (z)= e?z2+ e? z? 2 is 2e?= .) Thus,
N en 2n e?= n= 2n en ( 1 4) 1 4
(
?1=4)?1=4)
= (2? ( ))n; for ( )= 2(1? e 1 4
For all<, ( )> 0, which proves the proposition. As n ! 1, any n-sphere with radius p n,<, will contain at most (2? ( ))n points in f0; 1gn . Thus, any polynomial-sized collection of spheres cannot contain all the points in f0; 1gn . Thus we cannot hope to asymptotically improve the 0:9408:::
暂无评价 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 ...
热门文档