Sensitivity and block sensitivity of nested canalyzing function

Based on a recent characterization of nested canalyzing function (NCF), we obtain the formula of the sensitivity of any NCF. Hence we find that any sensitivity of NCF is between $\frac{n+1}{2}$ and $n$. Both lower and upper bounds are tight. We prove that the block sensitivity, hence the $l$-block s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Li, Yuan, Adeyeye, John O
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!