Journal of the ACM Bibliography
J. C. Lagarias and A. M. Odlyzko. Solving
low-density subset sum problems. Journal of the ACM,
32(1):229-246, January 1985.
[BibTeX entry]
Selected papers that cite this one
- M. Ajtai. Generating
hard instances of lattice problems (extended abstract). In
Proceedings of the Twenty-Eighth Annual ACM Symposium on the
Theory of Computing, pages 99-108, Philadelphia, Pennsylvania,
22-24 May 1996.
- Sanjeev Arora, László Babai, Jacques Stern, and Z.
Sweedyk. The
hardness of approximate optima in lattices, codes, and systems of linear
equations. Journal of Computer and System Sciences,
54(2):317-331, April 1997.
- Russell Impagliazzo and Moni Naor. Efficient
cryptographic schemes provably as secure as subset sum.
Journal of Cryptology, 9(4):199-216, Autumn 1996.
- Michael Kharitonov. Cryptographic lower
bounds for learnability of Boolean functions on the uniform
distribution. Journal of Computer and System Sciences,
50(3):600-610, June 1995.
Shortcuts: