Sciweavers

    STACS
    1998
    Springer
    88views Theoretical Computer Science» more  STACS 1998»
    Random Sparse Bit Strings at the Threshold of Adjacency
    14 years 4 months ago
    Random Sparse Bit Strings at the Threshold of Adjacency
    Download  comet.lehman.cuny.edu
    d Abstract appeared in STACS `98) Joel H. Spencer1 and Katherine St. John2 1 Courant Institute, New York University, New York, NY 10012 2 Department of Mathematics, Santa Clara Uni...
    Joel Spencer, Katherine St. John
    claim paper
    Read More »
    STOC
    2005
    ACM
    198views Algorithms» more  STOC 2005»
    On lattices, learning with errors, random linear codes, and cryptography
    15 years 27 days ago
    On lattices, learning with errors, random linear codes, and cryptography
    Download  www.cs.tau.ac.il
    Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
    Oded Regev
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.