Preview
Unable to display preview. Download preview PDF.
References
A. M. Frieze. On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem. Siam J. Comp (1986) vol. 15, no. 2, 536–539.
J. C. Lagarias and A. M. Odlyzko. Solving low-density subset sum problems. Proceedings of IEEE symposium on the foundations of Computer Science. (1983) 1–10.
A. K. Lenstra, H. W. Lenstra and L. Lovà sz. Factoring polynomials with rational coefficients. Math. Annalen 261 (1982) 515–534.
J. E. Mazo and A. M. Odlyzko. Lattice Points in High-dimensional Spheres. AT&T Technical Memorandum
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joux, A., Stern, J. (1991). Improving the critical density of the Lagarias-Odlyzko attack against subset sum problems. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_70
Download citation
DOI: https://doi.org/10.1007/3-540-54458-5_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54458-6
Online ISBN: 978-3-540-38391-8
eBook Packages: Springer Book Archive