1. On semidefinite programming relaxations for the satisfiability problem;Anjos;Math. Methods Oper. Res.,2004
2. Proofs of unsatisfiability via semidefinite programming;Anjos,2004
3. An improved semidefinite programming relaxation for the satisfiability problem;Anjos;Math. Program.,2005
4. Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems;Anjos;J. Satisf. Boolean Model. Comput.,2005
5. An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs;Anjos;Ann. Math. Artif. Intell.,2006