Sciweavers

    ECCC
    2010
    111views more  ECCC 2010»
    Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
    13 years 5 months ago
    Tight Bounds on the Approximability of Almost-satisfiable Horn SAT and Exact Hitting Set}
    Download  www.cs.cmu.edu
    We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
    Venkatesan Guruswami, Yuan Zhou
    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.