Sensitivity vs. block sensitivity of Boolean functions

From MaRDI portal
Publication:1894709

DOI10.1007/BF01200762zbMath0837.68080OpenAlexW2079009446MaRDI QIDQ1894709

David Rubinstein

Publication date: 16 April 1996

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01200762




Related Items (23)

Pseudo-average block sensitivity equals average sensitivityLower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variablesSensitivity, block sensitivity, and \(\ell\)-block sensitivity of Boolean functionsComputing Boolean functions from multiple faulty copies of input bitsSize of Sets with Small Sensitivity: A Generalization of Simon’s LemmaOn the average sensitivity of the weighted sum functionOptimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercubeSensitivity versus block sensitivity of Boolean functionsOn the resolution of the sensitivity conjectureUnnamed ItemConflict complexity is lower bounded by block sensitivitySensitivity vs. block sensitivity (an average-case study)Sensitivity Versus Certificate Complexity of Boolean FunctionsMaximal sensitivity of Boolean nested canalizing functionsThe simplified weighted sum function and its average sensitivitySensitivity, affine transforms and quantum communication complexitySensitivities and block sensitivities of elementary symmetric Boolean functionsTight bounds on sensitivity and block sensitivity of some classes of transitive functionsNew Constructions with Quadratic Separation between Sensitivity and Block SensitivityCertificate complexity of elementary symmetric Boolean functionsInduced subgraphs of hypercubes and a proof of the sensitivity conjectureComplexity measures and decision tree complexity: a survey.Certificate complexity and symmetry of nested canalizing functions



Cites Work


This page was built for publication: Sensitivity vs. block sensitivity of Boolean functions