Answers are grounded in this paper and cite their sources.
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite fields, giving a better estimate of the acceptance probability in terms of the distance of the tested function to the closest linear function.
No takes yet. Share an insight, caveat, or question.
Håstad et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: