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

An Improved Low-Density Subset Sum Algorithm M. J. Coster B. A. LaMacchia A. M. Odlyzko AT&T Bell Laboratories Murray Hill, New Jersey 07974 C. P. Schnorr Universitat Frankfurt Fachbereich Mathematik/Informatik Postfach 11 19 32 6000 Frankfurt am Main Germany y z

ABSTRACT

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 su ciently low density. Both methods rely on basis reduction algorithms to nd short non-zero vectors in special lattices. The Lagarias-Odlyzko algorithm would solve almost all subset sum problems of density< 0:6463::: in polynomial time if it could invoke a polynomial-time algorithm for nding the shortest non-zero vector in a lattice. This note shows that a simple modi cation of that algorithm would solve almost all problems of density< 0:9408::: if it could nd shortest non-zero vectors in lattices. This modi cation also yields dramatic improvements in practice when it is combined with known lattice basis reduction algorithms. y z

Visit to AT&T Bell Laboratories was supported by a Fulbright scholarship. Present address: MIT, Cambridge, MA 02139.

上一页第14页

你可能喜欢

热门文档

相关文档

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