Satisfiability, Branch-Width and Tseitin Tautologies.

Michael Alekhnovich Alexander A. Razborov

Published in: FOCS (2002)

Keyphrases

semidefinite
satisfiability problem
semidefinite programming
computational complexity
interior point methods
convex sets
sufficient conditions
higher dimensional
convex relaxation
training set
linear programming