Searching for "Solving Low-Density Subset Sum Problems" – sorted by Relevance.
6 documents found, showing 1 through 6.
-
On the Hardness of the Shortest Vector Problem
- …], solve low density subset-sum problems [54, 24, 20], heuristically factor integers [70, 18] and solve…
- Cited by 12 (1 self) – Add To MetaCart
-
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
- … ]) have been used in a host of applications, including integer programming, solving low-density subset-sum…
- Add To MetaCart
-
Lattice Points in High-Dimensional Spheres
- … for solving low-density subset-sum problems [9], where a crucial role in evaluating the performance…
- Cited by 15 (2 self) – Add To MetaCart
-
Cryptanalysis: A survey of recent results
- …. Lagarias and A. M. Odlyzko, "Solving Low Density Subset Sum Problems," J. Assoc. Comp. Mach., vol. 32, 1985…
- Add To MetaCart
-
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
- … programming, solving low-density subset-sum problems and breaking knapsackbased codes [LO], simultaneous…
- Cited by 117 (7 self) – Add To MetaCart
-
Approximating SVP_infinity to within Almost-Polynomial Factors is NP-hard
- … approximation algorithms have been used in a host of applications, including integer programming, solving low-density…
- Add To MetaCart
Showing 1 through 6.
