Conditional Lower Bounds for Sparse Parameterized 2-Constraint Satisfaction Problems: A Streamlined Proof

Assuming the Exponential Time Hypothesis (ETH), there is no f(k) · |Σ|o(k/ log k) time algorithm that can solve 2-CSP instances with k constraints over a domain of arbitrary large size |Σ|.