Sciweavers

    APPROX
    2008
    Springer
    128views Algorithms» more  APPROX 2008»

    Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness

    14 years 1 months ago
    Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
    Download  www.cs.cmu.edu
    Venkatesan Guruswami, Prasad Raghavendra
    claim paper
    Added 18 Oct 2010
    Updated 18 Oct 2010
    Type Conference
    Year 2008
    Where APPROX
    Authors Venkatesan Guruswami, Prasad Raghavendra
    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.