Approximating the noise sensitivity of a monotone Boolean function
© Ronitt Rubinfeld and Arsen Vasilyan. The noise sensitivity of a Boolean function f : {0, 1}n → {0, 1} is one of its fundamental properties. For noise parameter δ, the noise sensitivity is denoted as NSδ[f]. This quantity is defined as follows: First, pick x = (x1, . . ., xn) uniformly at random fr...
Format: | Article |
---|---|
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137665 |
Similar Items
-
Approximating the noise sensitivity of a monotone Boolean function
by: Rubinfeld, Ronitt, et al.
Published: (2022) -
Approximating the influence of monotone boolean functions in O(√n) query complexity
by: Ron, Dana, et al.
Published: (2012) -
Cryptographic properties of monotone Boolean functions
by: Carlet Claude, et al.
Published: (2016-03-01) -
Approximation by boolean sums of positive linear operators VI: monotone approximation and global smoothness preservation
by: H. H. Gonska, et al.
Published: (1999-02-01) -
Monotone Boolean Functions with s Zeros Farthest from Threshold Functions
by: Kazuyuki Amano, et al.
Published: (2005-01-01)