SDPs and robust satisfiability of promise CSP
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 …
outputs an assignment satisfying most of the constraints on instances that are near …