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

Lars Engebretsen, Jonas Holmerin. Three-Query PCPs with Perfect Completeness over non-Boolean Domains. In 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark. pages 284-299, IEEE Computer Society, 2003. [doi]

Abstract

Abstract is missing.