Some sieving algorithms for lattice problems
From MaRDI portal
Recommendations
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- Sampling methods for shortest vectors, closest vectors and successive minima
- A sieve algorithm for the shortest lattice vector problem
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- Lattice sparsification and the approximate closest vector problem
Cited in
(12)- Sampling methods for shortest vectors, closest vectors and successive minima
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
- scientific article; zbMATH DE number 475433 (Why is no real title available?)
- scientific article; zbMATH DE number 1852132 (Why is no real title available?)
- A randomized sieving algorithm for approximate integer programming
- Improved algorithms for the shortest vector problem and the closest vector problem in the infinity norm
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- Lattice sparsification and the approximate closest vector problem
- Algorithms for the densest sub-lattice problem
- Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
This page was built for publication: Some sieving algorithms for lattice problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165944)
