Lars Engebretsen, Jonas Holmerin. Three-Query PCPs with Perfect Completeness over non-Boolean Domains. Electronic Colloquium on Computational Complexity (ECCC), (040), 2002. [doi]
@article{ECCC-TR02-040,
title = {Three-Query PCPs with Perfect Completeness over non-Boolean Domains},
author = {Lars Engebretsen and Jonas Holmerin},
year = {2002},
url = {http://eccc.hpi-web.de/eccc-reports/2002/TR02-040/index.html},
tags = {completeness},
researchr = {https://researchr.org/publication/ECCC-TR02-040},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {040},
}