A Gaussian rounding algorithm for Boolean Max k-CSP is shown to achieve a (1 - o(1)) k/2^k approximation, matching known hardness bounds.
Optimal algorithms and inapproximability results for every CSP ?
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sharp Analysis of Gaussian Rounding for Boolean Max k-CSP
A Gaussian rounding algorithm for Boolean Max k-CSP is shown to achieve a (1 - o(1)) k/2^k approximation, matching known hardness bounds.