Sciweavers

    STACS
    2010
    Springer
    148views Theoretical Computer Science» more  STACS 2010»
    Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
    14 years 6 months ago
    Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
    Download  hal.inria.fr
    This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
    Xiaoyang Gu, John M. Hitchcock, Aduri Pavan
    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.