Breaking the epsilon-Soundness Bound of the Linearity Test over Gf(2)
For Boolean functions that are $\epsilon$-far from the set of linear functions, we study the lower bound on the rejection probability (denoted by REJ(epsilon) of the linearity test suggested by Blum, Luby, and Rubinfeld [J. Comput. System Sci., 47 (1993), pp. 549-595]. This problem is arguably the m...
Main Authors: | , , |
---|---|
Other Authors: | , |
Format: | Article |
Language: | English |
Published: |
Society for Industrial and Applied Mathematics,
2010-09-03T14:48:57Z.
|
Subjects: | |
Online Access: | Get fulltext |