Sciweavers

    137
    Voted
    SODA
    2012
    ACM
    217views Algorithms» more  SODA 2012»
    Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
    13 years 5 months ago
    Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
    Download  www2.isye.gatech.edu
    We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
    Daniel Dadush, Santosh Vempala
    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.