On semidefinite programming relaxations for the satisfiability problem.
Miguel F. AnjosPublished in: Math. Methods Oper. Res. (2004)
Keyphrases
- satisfiability problem
- semidefinite programming
- semidefinite
- linear programming
- quadratically constrained quadratic
- np complete
- temporal logic
- interior point methods
- search algorithm
- kernel matrix
- phase transition
- primal dual
- sat problem
- np hard
- stochastic local search algorithms
- linear program
- kernel function
- dynamic programming
- pairwise
- lower bound
- convergence rate
- query processing
- learning algorithm