Math @ Duke

Publications [#348669] of Benjamin Rossman
Papers Published
 Rossman, B, The Average Sensitivity of BoundedDepth Formulas,
Computational Complexity, vol. 27 no. 2
(June, 2018),
pp. 209223 [doi]
(last updated on 2022/05/19)
Abstract: We show that unbounded fanin Boolean formulas of depth d + 1 and size s have average sensitivity O(1dlogs)d. In particular, this gives a tight 2Ω(d(n1/d1)) lower bound on the size of depth d + 1 formulas computing the parity function. These results strengthen the corresponding 2Ω(n1/d) and O(log s) d bounds for circuits due to Håstad (Proceedings of the 18th annual ACM symposium on theory of computing, ACM, New York, 1986) and Boppana (Inf Process Lett 63(5): 257–261, 1997). Our proof technique studies a random process where the switching lemma is applied to formulas in an efficient manner.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

