A hybrid SDP-plus-linear-algebra algorithm and matching hardness result for satisfiable k-CSPs, enabled by a novel mixed invariance principle extending Mossel-O'Donnell-Oleszkiewicz.
Analysis of boolean functions
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Essentially tight thresholds for detectability of latent geometry in bipartite Gaussian RGGs under Bern(q) masked edges are determined for fixed p, ruling out computational-statistical gaps via a new Fourier-analytic framework.
citing papers explorer
-
On Approximability of Satisfiable k-CSPs: V
A hybrid SDP-plus-linear-algebra algorithm and matching hardness result for satisfiable k-CSPs, enabled by a novel mixed invariance principle extending Mossel-O'Donnell-Oleszkiewicz.
-
Information-Theoretic Thresholds for Bipartite Latent-Space Graphs under Noisy Observations
Essentially tight thresholds for detectability of latent geometry in bipartite Gaussian RGGs under Bern(q) masked edges are determined for fixed p, ruling out computational-statistical gaps via a new Fourier-analytic framework.