Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Wan, Andrew"'
Publikováno v:
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms.
A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean functions, where we