An improved semidefinite programming relaxation for the satisfiability problem.
Miguel F. AnjosPublished in: Math. Program. (2005)
Keyphrases
- satisfiability problem
- semidefinite programming
- semidefinite
- linear programming
- np complete
- temporal logic
- phase transition
- search algorithm
- stochastic local search algorithms
- interior point methods
- sat problem
- primal dual
- maximum margin
- kernel matrix
- sat instances
- convex relaxation
- model checking
- hyperplane
- constraint satisfaction problems