On Block Sensitivity and Fractional Block Sensitivity

Lobachevskii Journal of Mathematics(2018)

引用 3|浏览60
暂无评分
摘要
We investigate the relation between the block sensitivity bs( f ) and fractional block sensitivity fbs( f ) complexity measures of Boolean functions. While it is known that fbs( f ) = O(bs( f ) 2 ), the best known separation achieves fbs( f ) = ( ( 3√(2))^ - 1 + o( 1 ))bs( f )^3/2 . We improve the constant factor and show a family of functions that give fbs( f ) = (6 −1/2 − o (1)) bs( f ) 3/2 .
更多
查看译文
关键词
Query complexity,block sensitivity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要