Publication

Covering convex bodies and the Closest Vector Problem

Moritz Andreas Venzin, Márton Naszódi
2019
Journal paper

Abstract

We present faster algorithms for the approximate Closest Vector Problem under l_p norms

Official source

https://infoscience.epfl.ch/record/270059?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Covering convex bodies and the Closest Vector Problem

Graph Chatbot

Chat with Graph Search

Sketches, metrics and fast algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Sketches, metrics and fast algorithms

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma