Sciweavers

    MFCS
    2004
    Springer
    88views Theoretical Computer Science» more  MFCS 2004»

    All Superlinear Inverse Schemes Are coNP-Hard

    14 years 4 months ago
    All Superlinear Inverse Schemes Are coNP-Hard
    Download  theinf1.informatik.uni-jena.de
    How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds diagonalizations against certificates directly into a circuit.
    Edith Hemaspaandra, Lane A. Hemaspaandra, Harald H
    claim paper
    Added 02 Jul 2010
    Updated 02 Jul 2010
    Type Conference
    Year 2004
    Where MFCS
    Authors Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
    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.