An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs.

Miguel F. Anjos

Published in: Ann. Math. Artif. Intell. (2006)

Keyphrases

semidefinite
semidefinite programming
interior point methods
higher dimensional
sufficient conditions
convex sets
convex relaxation
denoising
linear programming
image denoising