122
click to vote
JSAT
2008
15 years 2 months ago
2008
This paper proposes a new semidefinite programming relaxation for the satisfiability problem. This relaxation is an extension of previous relaxations arising from the paradigm of ...