A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
From MaRDI portal
Publication:5091762
DOI10.4230/LIPIcs.CCC.2019.11OpenAlexW2964691826MaRDI QIDQ5091762
Publication date: 27 July 2022
Full work available at URL: https://arxiv.org/abs/1902.08340
Related Items (2)
Approximate Voronoi cells for lattices, revisited ⋮ A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
Cites Work
- Unnamed Item
- How close is the sample covariance matrix to the actual covariance matrix?
- Limits on the hardness of lattice problems in \(\ell_{p}\) norms
- A note on the distribution of the distance from a lattice
- On Lovász' lattice reduction and the nearest lattice point problem
- A hierarchy of polynomial time lattice basis reduction algorithms
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\)
- Sieving for closest lattice vectors (with preprocessing)
- Approx-SVP in ideal lattices with pre-processing
- Finding closest lattice vectors using approximate Voronoi cells
- Lattice points in high-dimensional spheres
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling
- On Bounded Distance Decoding for General Lattices
- Rearrangement of series in nonnuclear spaces
- A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
- An Inequality for Gaussians on Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: A time-distance trade-off for GDD with preprocessing: instantiating the DLW heuristic
