Moses Charikar, Venkatesan Guruswami, Rajsekar Manokaran. Every Permutation CSP of arity 3 is Approximation Resistant. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009. pages 62-73, IEEE Computer Society, 2009. [doi]
@inproceedings{CharikarGM09,
title = {Every Permutation CSP of arity 3 is Approximation Resistant},
author = {Moses Charikar and Venkatesan Guruswami and Rajsekar Manokaran},
year = {2009},
doi = {10.1109/CCC.2009.29},
url = {http://doi.ieeecomputersociety.org/10.1109/CCC.2009.29},
researchr = {https://researchr.org/publication/CharikarGM09},
cites = {0},
citedby = {0},
pages = {62-73},
booktitle = {Proceedings of the 24th Annual IEEE Conference on Computational Complexity, CCC 2009, Paris, France, 15-18 July 2009},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-3717-7},
}