嵌套分析函数的灵敏度和块灵敏度
Sensitivity and block sensitivity of nested canalyzing function
摘要:
本文基于嵌套分析函数(NCF)的一个新的特征,得到了任意NCF的灵敏度公式。因此,我们发现NCF的任何敏感性都在$\frac{n+1}{2}$和$n$之间。上界和下界都是紧的。我们证明了块敏感性,因此$l$ -块敏感性,是相同的敏感性。众所周知,单调函数也具有这种性质。我们最终找到所有的函数,这是单调和嵌套canalyzing(MNCF)。还提供了所有MNCF的基数。
英文摘要:
Based on a recent characterization of nested canalyzing function (NCF), we obtain the formula of the sensitivity of any NCF. Hence we find that any sensitivity of NCF is between $\frac{n+1}{2}$ and $n$. Both lower and upper bounds are tight. We prove that the block sensitivity, hence the $l$-block sensitivity, is same to the sensitivity. It is well known that monotone function also has this property. We eventually find all the functions which are both monotone and nested canalyzing (MNCF). The cardinality of all the MNCF is also provided.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。