Computer Science – Computational Complexity
Scientific paper
2011-08-17
Computer Science
Computational Complexity
7 pages
Scientific paper
In this note we give a new separation between sensitivity and block
sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
Ambainis Andris
Sun Xiaoming
No associations
LandOfFree
New separation between $s(f)$ and $bs(f)$ 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 New separation between $s(f)$ and $bs(f)$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New separation between $s(f)$ and $bs(f)$ will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-540696