Sciweavers

    STOC
    1996
    ACM
    97views Algorithms» more  STOC 1996»
    Deterministic Restrictions in Circuit Complexity
    13 years 9 months ago
    Deterministic Restrictions in Circuit Complexity
    Download  www.tcs.tifr.res.in
    We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
    Shiva Chaudhuri, Jaikumar Radhakrishnan
    claim paper
    Read More »
    STOC
    2007
    ACM
    83views Algorithms» more  STOC 2007»
    Verifying and decoding in constant depth
    14 years 5 months ago
    Verifying and decoding in constant depth
    Download  www.alexhealy.net
    Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
    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.