@article{Alekhnovich2003MoreOA,
title={More on Average Case vs Approximation Complexity},
author={Michael Alekhnovich},
journal={computational complexity},
year={2003},
volume={20},
pages={755-786}
}

We consider the problem to determine the maximal number of satisfiable equations in a linear system chosen at random. We make several plausible conjectures about the average case hardness of this problem for some natural distributions on the instances, and relate them to several interesting questions in the theory of approximation algorithms and in cryptography. Namely we show that our conjectures imply the following facts: ◦ Feige’s hypothesis about the hardness of refuting a random 3CNF is… CONTINUE READING