5 search results - page 1 / 1 » A Note on the Distance to Monotonicity of Boolean Functions |
ECCC
2008
13 years 4 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
DM
2010
13 years 5 months ago
2010
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this s...
RANDOM
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...