Approximate CVP_p in Time 2^{0.802 n}
From MaRDI portal
Publication:5874513
Cites work
- scientific article; zbMATH DE number 5485482 (Why is no real title available?)
- scientific article; zbMATH DE number 3633251 (Why is no real title available?)
- scientific article; zbMATH DE number 1182906 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 6607548 (Why is no real title available?)
- (Gap/S)ETH hardness of SVP
- A Geometric Analysis of the AWGN Channel With a <inline-formula> <tex-math notation="LaTeX">$(\sigma , \rho )$ </tex-math> </inline-formula>-Power Constraint
- A Greedy Heuristic for the Set-Covering Problem
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A random polynomial-time algorithm for approximating the volume of convex bodies
- A sieve algorithm for the shortest lattice vector problem
- Approximating CVP to within almost-polynomial factors is NP-hard
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Convex Bodies The Brunn-MinkowskiTheory
- Convex and Discrete Geometry
- Covering cubes and the closest vector problem
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Factoring polynomials with rational coefficients
- Faster exponential time algorithms for the shortest vector problem
- Hardness of approximating the shortest vector problem in lattices
- Integer Programming with a Fixed Number of Variables
- Intrinsic volumes and lattice points of crosspolytopes
- Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP)
- Minkowski's Convex Body Theorem and Integer Programming
- On some covering problems in geometry
- On weighted covering numbers and the Levi-Hadwiger conjecture
- Sampling methods for shortest vectors, closest vectors and successive minima
- Solving the shortest vector problem in \(2^n\) time using discrete Gaussian sampling (extended abstract)
- The shortest vector in a lattice is hard to approximate to within some constant
This page was built for publication: Approximate CVP_p in Time 2^{0.802 n}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874513)
