Cargando…
Covering Convex Bodies and the Closest Vector Problem
We present algorithms for the [Formula: see text] -approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms in dimension n has running time of [Formula: see text] . We improve this substantially in the following two...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9090713/ https://www.ncbi.nlm.nih.gov/pubmed/35572812 http://dx.doi.org/10.1007/s00454-022-00392-x |