Journal
INFORMATION PROCESSING LETTERS
Volume 116, Issue 5, Pages 331-336Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2016.01.002
Keywords
Boolean function; Weighted sum function; Average sensitivity; Computational complexity; Subset counting
Categories
Funding
- National Science Foundation of China [11001170]
- Natural Science Foundation of Shanghai Municipal [13ZR1422500]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
