Lars Engebretsen, Jonas Holmerin. More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. Random Struct. Algorithms, 33(4):497-514, 2008. [doi]
@article{EngebretsenH08,
title = {More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP},
author = {Lars Engebretsen and Jonas Holmerin},
year = {2008},
doi = {10.1002/rsa.20226},
url = {http://dx.doi.org/10.1002/rsa.20226},
researchr = {https://researchr.org/publication/EngebretsenH08},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {33},
number = {4},
pages = {497-514},
}