We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity. We propose to compare conflict complexity with certificate complexity, and explain why it could be interesting.
Cite
@article{arxiv.1810.08873,
title = {Conflict complexity is lower bounded by block sensitivity},
author = {Yaqiao Li},
journal= {arXiv preprint arXiv:1810.08873},
year = {2020}
}