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

DOI10.1145/3209108.3209186zbMath1452.90238arXiv1802.02388OpenAlexW2964147799MaRDI QIDQ5145277

Joanna Ochremiak, Albert Atserias

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02388

zbMATH Keywords

semidefinite programmingellipsoid methodfixed-point logicgraph isomorphism problemsums-of-squares

Mathematics Subject Classification ID

Semidefinite programming (90C22) Model theory of finite structures (03C13) Complexity of proofs (03F20)

Related Items (3)

Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem ⋮ Unnamed Item ⋮ Definable Inapproximability: New Challenges for Duplicator

This page was built for publication: Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem