On the average sensitivity of laced Boolean functions

Details On the average sensitivity of laced Boolean functions On the average sensitivity of laced Boolean functions

2011-08-16

arxiv.org/abs/1108.3198v2

Computer Science

Information Theory

8 pages

Scientific paper

In this paper we obtain the average sensitivity of the laced Boolean
functions. This confirms a conjecture of Shparlinski. We also compute the
weights of the laced Boolean functions and show that they are almost balanced.

Affiliated with

Also associated with

No associations

Rating

On the average sensitivity of laced Boolean functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the average sensitivity of laced Boolean functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the average sensitivity of laced Boolean functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-195228