期刊
INFORMATION PROCESSING LETTERS
卷 116, 期 5, 页码 331-336出版社
ELSEVIER
DOI: 10.1016/j.ipl.2016.01.002
关键词
Boolean function; Weighted sum function; Average sensitivity; Computational complexity; Subset counting
资金
- National Science Foundation of China [11001170]
- Natural Science Foundation of Shanghai Municipal [13ZR1422500]
In this paper we simplify the definition of the weighted sum Boolean function which used to be inconvenient to compute and use. We show that the new function has essentially the same properties as the previous one. In particular, the bound on the average sensitivity of the weighted sum Boolean function remains unchanged after the simplification. (C) 2016 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据