Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
From MaRDI portal
Publication:3190154
DOI10.1007/978-3-662-44602-7_9zbMath1417.68072OpenAlexW62046042MaRDI QIDQ3190154
Publication date: 15 September 2014
Published in: Advanced Information Systems Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-44602-7_9
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Critical properties and complexity measures of read-once Boolean functions ⋮ Certificate complexity and symmetry of nested canalizing functions
This page was built for publication: Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions
