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 …
A characterization of approximability for biased csps
A µ-biased Max-CSP instance with predicate ψ:{0, 1} r→{0, 1} is an instance of Constraint
Satisfaction Problem (CSP) where the objective is to find a labeling of relative weight at most …
Satisfaction Problem (CSP) where the objective is to find a labeling of relative weight at most …