Linearity testing in characteristic two
Efficient probabilistically checkable proofs and applications to approximations
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC ’93
IEEE Transactions on Information Theory
M. Sudan
C. Lund
M. Kiwi
J. Hastad
S. Goldwasser
D. Coppersmith
Two prover protocols
Inverse conjecture for the gowers norm is false