Conflict complexity is lower bounded by block sensitivity

10/21/2018

∙

by   Yaqiao Li, et al.

∙

0

∙

share

We show conflict complexity of any total boolean function, recently defined in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to study a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity. We also raise an interesting conjecture relating the composition theorem of randomized decision tree complexity to the long open conjecture that decision tree complexity is at most square of block sensitivity up to a constant.