scientific article; zbMATH DE number 6851849

DOI10.4230/LIPIcs.MFCS.2016.16zbMath1398.68176MaRDI QIDQ4608575

Satyanarayana V. Lokam, Mitali Bafna, Ameya Velingker, Sébastien Tavenas

Publication date: 21 March 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sensitivity conjectureanalysis of Boolean functionsread-\(k\) formulas

Mathematics Subject Classification ID

Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Alternation, sparsity and sensitivity: bounds and exponential gaps ⋮ A tighter relation between sensitivity complexity and certificate complexity ⋮ Tight bounds on sensitivity and block sensitivity of some classes of transitive functions