A general reduction from locally testable codes produces linear sensitivity lower bounds for (1-ε)-approximations to satisfiable Max E3LIN2 and several other CSPs, plus an Ω(1/ε) bound for Max Cut on bipartite graphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sensitivity Lower Bounds via Locally Testable Codes
A general reduction from locally testable codes produces linear sensitivity lower bounds for (1-ε)-approximations to satisfiable Max E3LIN2 and several other CSPs, plus an Ω(1/ε) bound for Max Cut on bipartite graphs.