Sciweavers

    108
    Voted
    FOCS
    2005
    IEEE
    106views Theoretical Computer Science» more  FOCS 2005»
    Hardness of Approximating the Closest Vector Problem with Pre-Processing
    15 years 8 months ago
    Hardness of Approximating the Closest Vector Problem with Pre-Processing
    Download  www.math.ias.edu
    d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...
    Mikhail Alekhnovich, Subhash Khot, Guy Kindler, Ni...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.