On Semideenite Programming Relaxations of (2 + P)-sat


Recently, De Klerk, Van Maaren and Warners 7] investigated a relaxation of 3-SAT via semideenite programming. Thus a 3-SAT formula is relaxed to a semideenite feasibility problem. If the feasibility problem is infeasible then a certiicate of unsatissability of the formula is obtained. The authors proved that this approach is exact for several polynomially… (More)


2 Figures and Tables