On the Lagarias-Odlyzko algorithm for the subset sum problem
作者： A. M. Frieze
DOI: 10.1137/0215038
关键词:
摘要: We give a simple analysis of an algorithm for solving subset-sum problems proposed by Lagarias and Odlyzko [2].
acm.org
aip.org
sci-hub.se 参考文章(3)
R. Merkle, M. Hellman, Hiding information and signatures in trapdoor knapsacks IEEE Transactions on Information Theory. ,vol. 24, pp. 525- 530 ,(1978) , 10.1109/TIT.1978.1055927
A. K. Lenstra, H. W. Lenstra, L. Lovász, Factoring Polynomials with Rational Coefficients Mathematische Annalen. ,vol. 261, pp. 515- 534 ,(1982) , 10.1007/BF01457454
J. C. Lagarias, A. M. Odlyzko, Solving low-density subset sum problems Journal of the ACM. ,vol. 32, pp. 229- 246 ,(1985) , 10.1145/2455.2461