Sciweavers

    MFCS
    1998
    Springer
    89views Theoretical Computer Science» more  MFCS 1998»

    Minimum Propositional Proof Length is NP-Hard to Linearly Approximate

    14 years 3 months ago
    Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
    Download  math.ucsd.edu
    Michael Alekhnovich, Samuel R. Buss, Shlomo Moran,
    claim paper
    Added 06 Aug 2010
    Updated 06 Aug 2010
    Type Conference
    Year 1998
    Where MFCS
    Authors Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi
    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.