ECCC-Report TR16-132https://eccc.weizmann.ac.il/report/2016/132Comments and Revisions published for TR16-132en-usTue, 23 Aug 2016 23:24:43 +0300
Paper TR16-132
| On the Sensitivity Conjecture for Read-k Formulas |
Mitali Bafna,
Satyanarayana V. Lokam,
Sébastien Tavenas,
Ameya Velingker
https://eccc.weizmann.ac.il/report/2016/132Various combinatorial/algebraic parameters are used to quantify the complexity of a Boolean function. Among them, sensitivity is one of the simplest and block sensitivity is one of the most useful. Nisan (1989) and Nisan and Szegedy (1991) showed that block sensitivity and several other parameters, such as certificate complexity, decision tree depth, and degree over R, are all polynomially related to one another. The sensitivity conjecture states that there is also a polynomial relationship between sensitivity and block sensitivity, thus supplying the "missing link".
Since its introduction in 1991, the sensitivity conjecture has remained a challenging open question in the study of Boolean functions. One natural approach is to prove it for special classes of functions. For instance, the conjecture is known to be true for monotone functions, symmetric functions, and functions describing graph properties.
In this paper, we consider the conjecture for Boolean functions computable by read-k formulas. A read-k formula is a tree in which each variable appears at most k times among the leaves and has Boolean gates at its internal nodes. We show that the sensitivity conjecture holds for read-once formulas with gates computing symmetric functions. We next consider regular formulas with OR and AND gates. A formula is regular if it is a leveled tree with all gates at a given level having the same fan-in and computing the same function. We prove the sensitivity conjecture for constant depth regular read-k formulas for constant k.Tue, 23 Aug 2016 23:24:43 +0300https://eccc.weizmann.ac.il/report/2016/132