Sciweavers

    ECCC
    2008
    65views more  ECCC 2008»
    A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
    13 years 11 months ago
    A Lower Bound on the Size of Series-Parallel Graphs Dense in Long Paths
    Download  cseweb.ucsd.edu
    One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
    Chris Calabro
    claim paper
    Read More »
    FOCS
    2006
    IEEE
    142views Theoretical Computer Science» more  FOCS 2006»
    On the Compressibility of NP Instances and Cryptographic Applications
    14 years 5 months ago
    On the Compressibility of NP Instances and Cryptographic Applications
    Download  www.wisdom.weizmann.ac.il
    We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
    Danny Harnik, Moni Naor
    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.