Approximation Resistance by Disguising Biased Distributions
Computational Complexity
2015-11-10 v9
Abstract
In this short note, the author shows that the gap problem of some 3-XOR is NP-hard and can be solved by running Charikar\&Wirth's SDP algorithm for two rounds. To conclude, the author proves that .
Keywords
Cite
@article{arxiv.1401.6520,
title = {Approximation Resistance by Disguising Biased Distributions},
author = {Peng Cui},
journal= {arXiv preprint arXiv:1401.6520},
year = {2015}
}
Comments
6 pages, short note