Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems

@inproceedings{Karpinski2008LinearTA,
  title={Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems},
  author={Marek Karpinski and Warren Schudy},
  booktitle={STOC},
  year={2008}
}
We design a linear time approximation scheme for the Gale-Berlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest Codeword Problem (NCP) and Unique Games Problem. Further applications include, among other things, finding a constrained form of matrix rigidity and maximum likelihood decoding of an error correcting code. As another application of our method we give the first linear time approximation schemes for correlation… CONTINUE READING
Highly Cited
This paper has 30 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 17 extracted citations

References

Publications referenced by this paper.
Showing 1-5 of 5 references

On the Hardness of Decoding the Gale–Berlekamp Code

IEEE Transactions on Information Theory • 2007
View 5 Excerpts
Highly Influenced

The correct solution to Berlekamp's switching game

Discrete Mathematics • 2004
View 5 Excerpts
Highly Influenced

Ten Lectures on the Probabilistic Method

J. Spencer
SIAM, second edition • 1994
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…