Sciweavers

    2 search results - page 1 / 1
    » A Simplified NP-Complete MAXSAT Problem
    Sort
    View
    CP
    2009
    Springer
    153views Artificial Intelligence» more  CP 2009»
    Approximating Weighted Max-SAT Problems by Compensating for Relaxations
    16 years 4 months ago
    Approximating Weighted Max-SAT Problems by Compensating for Relaxations
    Download  reasoning.cs.ucla.edu
    We introduce a new approach to approximating weighted Max-SAT problems that is based on simplifying a given instance, and then tightening the approximation. First, we relax its str...
    Arthur Choi, Trevor Standley, Adnan Darwiche
    claim paper
    Read More »
    IPL
    1998
    45views more  IPL 1998»
    A Simplified NP-Complete MAXSAT Problem
    15 years 3 months ago
    A Simplified NP-Complete MAXSAT Problem
    Download  www.ti.inf.ethz.ch
    Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.