Breaking the epsilon-Soundness Bound of the Linearity Test over Gf(2)

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...

Full description

Bibliographic Details
Main Authors: Kaufman-Halman, Tali (Contributor), Litsyn, Simon (Author), Xie, Ning (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2010-09-03T14:48:57Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items