Three-Query PCPs with Perfect Completeness over non-Boolean Domains

Lars Engebretsen, Jonas Holmerin. Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Electronic Colloquium on Computational Complexity (ECCC), (040), 2002. [doi]

Abstract

Abstract is missing.