More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP

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]

Abstract

Abstract is missing.