Johan Håstad, Subhash Khot. Query Efficient PCPs with Perfect Completeness. Theory of Computing, 1(1):119-148, 2005. [doi]
@article{HastadK05,
title = {Query Efficient PCPs with Perfect Completeness},
author = {Johan Håstad and Subhash Khot},
year = {2005},
doi = {10.4086/toc.2005.v001a007},
url = {http://dx.doi.org/10.4086/toc.2005.v001a007},
tags = {completeness},
researchr = {https://researchr.org/publication/HastadK05},
cites = {0},
citedby = {0},
journal = {Theory of Computing},
volume = {1},
number = {1},
pages = {119-148},
}