Sciweavers

    STOC
    1994
    ACM
    95views Algorithms» more  STOC 1994»
    Improved non-approximability results
    14 years 3 months ago
    Improved non-approximability results
    Download  people.csail.mit.edu
    We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a...
    Mihir Bellare, Madhu Sudan
    claim paper
    Read More »
    FOCS
    1995
    IEEE
    104views Theoretical Computer Science» more  FOCS 1995»
    Free Bits, PCPs and Non-Approximability - Towards Tight Results
    14 years 3 months ago
    Free Bits, PCPs and Non-Approximability - Towards Tight Results
    Download  cseweb.ucsd.edu
    This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
    Mihir Bellare, Oded Goldreich, Madhu Sudan
    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.