Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem

Descriptive complexity of graph spectra

(2019) Anuj Dawar et al.   ANNALS OF PURE AND APPLIED LOGIC

Solving Linear Programs without Breaking Abstractions

(2015) Matthew Anderson et al.   JOURNAL OF THE ACM

Strong duality in Lasserre’s hierarchy for polynomial optimization

(2015) Cédric Josz et al.   Optimization Letters

Sherali–Adams relaxations of graph isomorphism polytopes

(2014) Peter N. Malkin   Discrete Optimization

Sherali--Adams Relaxations and Indistinguishability in Counting Logics

(2013) Albert Atserias et al.   SIAM JOURNAL ON COMPUTING

On the Complexity of Numerical Analysis

(2009) Eric Allender et al.   SIAM JOURNAL ON COMPUTING

Semidefinite programming and arithmetic circuit evaluation

(2007) Sergey P. Tarasov et al.   DISCRETE APPLIED MATHEMATICS