Jan Krajíček, Proof Complexity, 2019
Razborov A., “On the Width of Semialgebraic Proofs and Algorithms”, Math. Oper. Res., 42:4 (2017), 1106–1134
Atserias A., Lauria M., Nordstrom J., “Narrow Proofs May Be Maximally Long”, ACM Trans. Comput. Log., 17:3 (2016), 19
Alexander Razborov, “Guest Column”, SIGACT News, 47:2 (2016), 66
Margulies S., Onn S., Pasechnik D.V., “on the Complexity of Hilbert Refutations For Partition”, J. Symbolic Comput., 66 (2015), 70–83
Atserias A., Lauria M., Nordstrom J., “Narrow Proofs May Be Maximally Long”, 2014 IEEE 29Th Conference on Computational Complexity (Ccc), IEEE Conference on Computational Complexity, IEEE, 2014, 286–297
Dantchev S., Martin B., “Rank Complexity Gap for Lovasz-Schrijver and Sherali-Adams Proof Systems”, Comput. Complex., 22:1 (2013), 191–213
Anjos M.F., Vieira M.V.C., “Semidefinite Resolution and Exactness of Semidefinite Relaxations for Satisfiability”, Discrete Appl. Math., 161:18 (2013), 2812–2826
Albert Atserias, Lecture Notes in Computer Science, 7962, Theory and Applications of Satisfiability Testing – SAT 2013, 2013, 1
Pitassi T., Segerlind N., “Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovasz-Schrijver Procedures”, SIAM J Comput, 41:1 (2012), 128–159