On the Sensitivity Conjecture for Disjunctive Normal Forms

DOI10.4230/LIPIcs.FSTTCS.2016.15zbMath1391.68057arXiv1607.05189OpenAlexW2963542592MaRDI QIDQ4636562

C. S. Karthik, Sébastien Tavenas

Publication date: 19 April 2018

Full work available at URL: https://arxiv.org/abs/1607.05189

zbMATH Keywords

sensitivityBoolean functionblock sensitivityDNF

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Alternation, sparsity and sensitivity: bounds and exponential gaps ⋮ A tighter relation between sensitivity complexity and certificate complexity

This page was built for publication: On the Sensitivity Conjecture for Disjunctive Normal Forms