The Limits of SDP Relaxations for General-Valued CSPs
From MaRDI portal
Publication:4973880
DOI10.1145/3201777zbMath1427.90245arXiv1612.01147OpenAlexW2560316516MaRDI QIDQ4973880
Stanislav Živný, Johan Thapper
Publication date: 6 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.01147
convex relaxationsdiscrete optimizationLasserre hierarchysum of squaresSDPvalued constraint satisfaction problems
Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Combinatorial optimization (90C27)
Related Items (2)
This page was built for publication: The Limits of SDP Relaxations for General-Valued CSPs