On approximability of Satisfiable k -CSPs: I
Name
37_2025_Article_267.pdf
Size
727.35 KB
Format
Adobe PDF
Checksum (MD5)
79a1a888034ea42b41235fd6f944e37f
Author(s)
Bhangale, Amey
Khot, Subhash
Minzer, Dor
Date Issued
July 22, 2025
Journal
computational complexity
Publisher
Springer International Publishing
Citation
Bhangale, A., Khot, S. & Minzer, D. On approximability of Satisfiable
-CSPs: I. comput. complex. 34, 8 (2025).
Version
Final published version
Abstract
We consider the P -CSP problem for 3-ary predicates P on satisfiable instances. We show that under certain conditions on P and a ( 1 , s ) integrality gap instance of the P -CSP problem, it can be translated into a dictatorship vs. quasirandomness test with perfect completeness and soundness s + ϵ , for every constant ϵ > 0 . Compared to Ragahvendra (in: Proceedings of the fortieth annual ACM symposium on theory of computing (STOC), pp 245–254, 2008), we do not lose perfect completeness. This is particularly interesting as this test implies new hardness results on satisfiable constraint satisfaction problems, assuming the Rich 2-to-1 Games Conjecture by Braverman et al. (in: Lee JR (ed) Volume 185 of Leibniz international proceedings in informatics (LIPIcs), 27:1–27:20. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, 2021b. https://drops.dagstuhl.de/opus/volltexte/2021/13566 ).Our result can be seen as the first step of a potentially long-term challenging program of characterizing optimal inapproximability of every satisfiable k -ary CSP. At the heart of the reduction is our main analytical lemma for a class of 3-ary predicates, which is a generalization of a lemma by Mossel (Geom Funct Anal 19(6):1713–1756, 2010). The lemma and a further generalization of it that we conjecture may be of independent interest.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00037-025-00267-6
