Can I read Semidefinite Programming and Linear Equations vs. Homomorphism Problems on EtoBox?

Semidefinite Programming and Linear Equations vs. Homomorphism Problems by Ciardo, Lorenzo; Živný, Stanislav is a scholarly article available to read on EtoBox.

What is Semidefinite Programming and Linear Equations vs. Homomorphism Problems about?

We introduce a relaxation for homomorphism problems that combines semidefinite programming with linear Diophantine equations, and propose a framework for the analysis of its power based on the spectral theory of association schemes. We use this framework to establish an unconditional lower bound against the semidefinite programming + linear equations model, by showing that the relaxation does not solve the approximate graph homomorphism problem and thus, in particular, the approximate graph colouring problem.

Author

Ciardo, Lorenzo; Živný, Stanislav

Published

2023

Language

EN