Query efficient PCPs with perfect completeness (2005)

by J Håstad, S Khot
Venue:Theory of Computing