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
Finding short vectors in lattices may be very hard in general. On the other hand, published algorithms, such as the L one, perform much better in practice than is guaranteed by their worst case bounds, especially when they are modi ed 11, 12, 17], and new algorithms are being invented 18, 19, 20]. Thus it is possible that on average, the proble
m of nding short vectors in lattices is easy, even if it is hard in the worst case. Therefore it seems worthwhile to separate the issues of e ciency of lattice basis reduction algorithms from the question of how well the subset sum problem can be reduced to that of nding a short vector in a lattice. (Note that Paz and Schnorr 16] have shown that the general problem of nding the shortest non-zero vector in a lattice is reducible to that of solving some subset sum problem, but with some loss of e ciency.) Consider a lattice oracle that, given a basis for a lattice, with high probability yields in polynomial time the shortest non-zero vector in that lattice. We do not know how to construct such an oracle, but it might be possible to do so, and in any case in relatively low dimensions, known polynomial time algorithms act like such an oracle. The analysis of 11] showed that availability of such an oracle would let the Lagarias-Odlyzko algorithm solve almost all subset sum problems of density< 0:6463:::, but not higher than that. (Similar analyses are not available for the Brickell algorithm 1], although it seems to require even lower densities. See also 8].) In this note we analyze a simple modi cation of the part of the Lagarias-Odlyzko algorithm that reduces the subset sum problem to a short vector in a lattice problem. We show that with this modi cation, a single call to a lattice oracle would lead to polynomial time solutions of almost all problems of density< 0:9408::: . Empirical tests show that this modi cation also leads to dramatic improvement in the performance of practical algorithms. We present some results on this in Section 4. More data and fuller comparisons will be given in 12]. In Section 2 we derive the Lagarias-Odlyzko bound using the approach in 7]. We show in Section 3 that this bound may be increased to 0:9408::: using a simple modi cation of the Lagarias-Odlyzko attack. Finally, Section 4 discusses possible improvements on the new bound and practical results. 3
2. Previous results In 11], Lagarias and Odlyzko show that if the density is bounded by 0:6463:::, the lattice oracle is guaranteed to nd the solution vector with high probability. This
暂无评价 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 ...
热门文档