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.
More Efficient Queries in PCP s for NP and Improved Approximation Hardness of Maximum CSP
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 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.