文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Improved low-density subset sum algorithms
侵权投诉

Improved low-density subset sum algorithms

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

上一页第10页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email