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 …
Separating max 2-and, max di-cut and max cut
Assuming the Unique Games Conjecture (UGC), the best approximation ratio that can be
obtained in polynomial time for the MAX CUT problem is CUT≃0.87856, obtained by the …
obtained in polynomial time for the MAX CUT problem is CUT≃0.87856, obtained by the …
Learning from survey propagation: a neural network for MAX-E-3-SAT
R Marino - Machine Learning: Science and Technology, 2021 - iopscience.iop.org
Many natural optimization problems are NP-hard, which implies that they are probably hard
to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for …
to solve exactly in the worst-case. However, it suffices to get reasonably good solutions for …
On lifting integrality gaps to SSEH hardness for globally constrained csps
A μ-constrained Boolean MAX-CSP (ψ) instance is a Boolean Max-CSP instance on
predicate ψ:{0,1\}^r→{0,1\} where the objective is to find a labeling of relative weight exactly …
predicate ψ:{0,1\}^r→{0,1\} where the objective is to find a labeling of relative weight exactly …
Approximability of Constraint Satisfaction Problems in the Streaming Setting
S Velusamy - 2023 - search.proquest.com
Abstract Maximum Constraint satisfaction problems (Max-CSPs) are ubiquitous in computer
science and encompass optimization problems such as Max-CUT, Max-DICUT, Max-kSAT …
science and encompass optimization problems such as Max-CUT, Max-DICUT, Max-kSAT …
[PDF][PDF] New Directions in Inapproximability: Promise Constraint Satisfaction Problems and Beyond
SS Pallerla - 2022 - reports-archive.adm.cs.cmu.edu
The field of hardness of approximation has seen a lot of progress in the past three decades
resulting in almost optimal inapproximability results for many computational problems …
resulting in almost optimal inapproximability results for many computational problems …