Sciweavers

    STOC
    2012
    ACM
    197views Algorithms» more  STOC 2012»

    Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates

    12 years 1 months ago
    Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
    Download  www.ccs.neu.edu
    Anna Gál, Kristoffer Arnsfelt Hansen, Micha
    claim paper
    Added 28 Sep 2012
    Updated 28 Sep 2012
    Type Journal
    Year 2012
    Where STOC
    Authors Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
    Comments (0)
    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.