Maximal sensitivity of Boolean nested canalizing functions

DOI10.1016/j.tcs.2019.04.025zbMath1436.94127OpenAlexW2946805110WikidataQ127827499 ScholiaQ127827499MaRDI QIDQ2272408

Yuan Li, John Ola-Oluwa Adeyeye

Publication date: 10 September 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2019.04.025

zbMATH Keywords

sensitivityBoolean functionmonotone functionblock sensitivitynested canalizing functionlayer structure

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Related Items (4)

Multistate nested canalizing functions and their networks ⋮ Sensitivities and block sensitivities of elementary symmetric Boolean functions ⋮ Certificate complexity of elementary symmetric Boolean functions ⋮ Certificate complexity and symmetry of nested canalizing functions

Cites Work

• Unnamed Item
• Cryptographic properties of monotone Boolean functions
• Boolean nested canalizing functions: a comprehensive analysis
• Nested canalyzing depth and network stability
• The number of multistate nested canalyzing functions
• Multistate nested canalizing functions and their networks
• Design by example: An application of Armstrong relations
• Reductions for monotone Boolean circuits
• A theory of diagnosis from first principles
• The influence of canalization on the robustness of Boolean networks
• Sensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functions
• Sensitivity vs. block sensitivity of Boolean functions
• Stratification and enumeration of Boolean functions by canalizing depth
• Nested canalyzing, unate cascade, and polynomial functions
• Counting inequivalent monotone Boolean functions.
• Complexity of identification and dualization of positive Boolean functions
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• How to assign votes in a distributed system
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• CREW PRAM<scp>s</scp> and Decision Trees
• The Maximum Latency and Identification of Positive Boolean Functions
• Identifying the Minimal Transversals of a Hypergraph and Related Problems

This page was built for publication: Maximal sensitivity of Boolean nested canalizing functions