Optimal Inapproximability of Promise Equations over Finite Groups

Abstract

A celebrated result of Hastad established that, for any constant $\epsilon >0$, it is NP-hard to find an assignment satisfying a $(1/|G|+\epsilon )$-fraction of the constraints of a given 3-LIN instance over an Abelian group $G$ even if one is promised that an assignment satisfying a $(1-\epsilon )$-fraction of the constraints exists. Engebretsen, Holmerin, and Russell showed the same result for 3-LIN instances over any finite (not necessarily Abelian) group. In other words, for almost-satisfiable instances of 3-LIN the random assignment achieves an optimal approximation guarantee. We prove that the random assignment algorithm is still best possible under a stronger promise that the 3-LIN instance is almost satisfiable over an arbitrarily more restrictive group.

Full version of an ICALP(A)'25 paper