Kojevnikov A., Itsykson D., “Lower bounds of static Lovász-Schrijver calculus proofs for Tseitin tautologies”, Automata, languages and programming, Part I, Lecture Notes in Comput. Sci., 4051, Springer, Berlin, 2006, 323–334
Hirsch E.A., Kojevnikov A., “Several notes on the power of Gomory-Chvatal cuts”, Ann. Pure Appl. Logic, 141:3 (2006), 429–436
Hirsch E.A., Nikolenko S.I., “Simulating cutting plane proofs with restricted degree of falsity by resolution”, Theory and applications of satisfiability testing, Lecture Notes in Comput. Sci., 3569, Springer, Berlin, 2005, 135–142
Anjos M.F., “An improved semidefinite programming relaxation for the satisfiability problem”, Math. Program., 102:3, Ser. A (2005), 589–608
Anjos M.F., “On semidefinite programming relaxations for the satisfiability problem”, Math. Methods Oper. Res., 60:3 (2004), 349–367