Application of mixed integer quadratic program to shortest vector problems
From MaRDI portal
Recommendations
- Explicit Hard Instances of the Shortest Vector Problem
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Sieve algorithms for the shortest vector problem are practical
- Annealing-based algorithm for solving CVP and SVP
- Optimization of search space for finding very short lattice vectors
Cites work
- A survey of solving SVP algorithms and recent strategies for solving the SVP challenge
- Conflict analysis in mixed integer programming
- Factoring polynomials with rational coefficients
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Predicting Lattice Reduction
- Presolve Reductions in Mixed Integer Programming
- Second-order cone programming
Cited in
(3)
This page was built for publication: Application of mixed integer quadratic program to shortest vector problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121492)