文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > 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

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:

上一页第9页

你可能喜欢

热门文档

相关文档

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