On Boolean functions with low sensitivity
نویسنده
چکیده
We review several complexity measures for Boolean functions which are related to the study of the decision tree model. Among those measures, sensitivity is the simplest to define, but the most difficult to prove upper bounds in terms of it. We discuss the known upper bounds on other measures in terms of sensitivity and the proof techniques. By a simple decision tree construction, we suggest two conjectures that, if both are true, would imply a polynomial upper bound on decision tree complexity in terms of sensitivity.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملBounds on the Average Sensitivity of Nested Canalizing Functions
Nested canalizing Boolean functions (NCF) play an important role in biologically motivated regulatory networks and in signal processing, in particular describing stack filters. It has been conjectured that NCFs have a stabilizing effect on the network dynamics. It is well known that the average sensitivity plays a central role for the stability of (random) Boolean networks. Here we provide a ti...
متن کاملPolynomial representation, Fourier transform and complexity of Boolean functions
We study the Log-rank Conjecture for XOR functions and the Sensitivity Conjecture by exploiting structure of the Fourier transform and polynomial representations of Boolean functions. For the Log-rank Conjecture for XOR functions, we show that the it is true for functions with small spectral norm or low F2-degree. More precisely, we prove the following two bounds. 1. CC(f(x⊕ y)) = O(‖f̂‖1 · log ...
متن کاملPseudorandom Generators for Low Sensitivity Functions
A Boolean function is said to have maximal sensitivity s if s is the largest number of Hamming neighbors of a point which differ from it in function value. We construct a pseudorandom generator with seed-length 2O( √ s) · log(n) that fools Boolean functions on n variables with maximal sensitivity at most s. Prior to our work, the best pseudorandom generators for this class of functions required...
متن کاملAverage Sensitivity and Noise Sensitivity of Polynomial Threshold Functions
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-d polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube {−1, 1}n and for multilinear PTFs over R n under the standard n-dimensional Gaussian distribution N (0, In). Our bound on the Boolean average sensitivity of PTFs represents progress towards the r...
متن کامل