Sensitivity of Boolean formulas

DOI10.1016/J.EJC.2012.12.006MaRDI QIDQ1943387zbMATH OpenOpenAlexFDO

Authors Nadia Creignou, Hervé Daudé

Publication date 19 March 2013

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2012.12.006

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• On the sensitivity conjecture for read-\(k\) formulas
• On extremal \(k\)-CNF formulas
• On extremal \(k\)-CNF formulas
• Sensitivities and block sensitivities of elementary symmetric Boolean functions
• Maximal sensitivity of Boolean nested canalizing functions

Cited in

(3)

• scientific article; zbMATH DE number 6850428 (Why is no real title available?)
• scientific article; zbMATH DE number 4057001 (Why is no real title available?)
• Boolean functions with low average sensitivity depend on few coordinates

This page was built for publication: Sensitivity of Boolean formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943387)