Direct sum testing
The k-fold direct sum encoding of a string α∈--0, 1} n is a function f α that takes as input sets
S⊆[n] of size k and outputs f α (S)=∑ i∈ S αi (mod 2. In this paper we prove a Direct Sum …
S⊆[n] of size k and outputs f α (S)=∑ i∈ S αi (mod 2. In this paper we prove a Direct Sum …
[CITA][C] An approach to the sliding scale conjecture via parallel repetition for low degree testing
D Moshkovitz - Technical Report 30 ECCC, 2014