Lars Engebretsen Jonas Holmerin More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP. 497-514 2008 33 Random Struct. Algorithms 4 http://dx.doi.org/10.1002/rsa.20226 db/journals/rsa/rsa33.html#EngebretsenH08