On Semidefinite Programming Relaxations of (2+p)-SAT


Recently, de Klerk, van Maaren and Warners [10] investigated a relaxation of 3-SAT via semidefinite programming. Thus a 3-SAT formula is relaxed to a semidefinite feasibility problem. If the feasibility problem is infeasible then a certificate of unsatisfiability of the formula is obtained. The authors proved that this approach is exact for several… (More)
DOI: 10.1023/A:1021208315170


12 Figures and Tables