Linear PCPs

A variant of PCPs, where instead of querying specific positions of the proof string, the verifier queries linear combinations $q_i\mapsto ⟨q_i,\pi ⟩$ of the proof string $\pi \in {\mathbb{F}}^m$.

Resources

• Alessandro Chiesa’s Thesis