SDPs and Robust Satisfiab
SDPs and Robust Satisfiability of Promise CSP
SDPs and Robust Satisfiability of Promise CSP
arXiv:2211.08373v4 Announce Type: replace
Abstract: For a constraint satisfaction problem (CSP), a robust satisfaction algorithm is one that outputs an assignment satisfying most of the constraints on instances that are near-satisfiable. It is known that the CSPs that admit efficient robust satisfa…
