A characterization of nested canalyzing functions with maximum average sensitivity

DOI10.1016/j.dam.2018.05.014zbMath1435.94161OpenAlexW2809586174WikidataQ129627803 ScholiaQ129627803MaRDI QIDQ1627840

S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns, Madhav V. Marathe

Publication date: 3 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.05.014

zbMATH Keywords

characterizationBoolean functionscountingnested canalyzing functionsmaximum average sensitivity

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Boolean functions (06E30) Switching theory, applications of Boolean algebras to circuits and networks (94C11)

Related Items (1)

Critical properties and complexity measures of read-once Boolean functions

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Boolean nested canalizing functions: a comprehensive analysis
• Nested canalyzing depth and network stability
• Multistate nested canalizing functions and their networks
• On the degree of Boolean functions as real polynomials
• The influence of canalization on the robustness of Boolean networks
• Complexity measures and decision tree complexity: a survey.
• Stratification and enumeration of Boolean functions by canalizing depth
• Analysis of Boolean Functions

This page was built for publication: A characterization of nested canalyzing functions with maximum average sensitivity