Relaxations of the Satisfiability Problem Using Semidefinite Programming.
Etienne de KlerkHans van MaarenJoost P. WarnersPublished in: J. Autom. Reason. (2000)
Keyphrases
- satisfiability problem
- semidefinite programming
- semidefinite
- linear programming
- quadratically constrained quadratic
- np complete
- temporal logic
- np hard
- search algorithm
- phase transition
- interior point methods
- primal dual
- kernel matrix
- sat problem
- stochastic local search algorithms
- objective function
- dynamic programming
- linear program
- machine learning
- maximum margin
- lower bound
- feature space
- optimal solution