Conflict complexity is lower bounded by block sensitivity

10/21/2018
by   Yaqiao Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/16/2022

Decision Tree Complexity versus Block Sensitivity and Degree

Relations between the decision tree complexity and various other complex...
research
01/10/2018

A Composition Theorem via Conflict Complexity

Let (·) stand for the bounded-error randomized query complexity. We show...
research
09/06/2020

Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture

We give improved separations for the query complexity analogue of the lo...
research
08/06/2022

An Optimal "It Ain't Over Till It's Over" Theorem

We study the probability of Boolean functions with small max influence t...
research
10/14/2020

Complexity Measures on the Symmetric Group and Beyond

We extend the definitions of complexity measures of functions to domains...
research
07/08/2023

A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers

We prove a strong composition theorem for junta complexity and show how ...
research
03/31/2022

Lower bounds for uniform read-once threshold formulae in the randomized decision tree model

We investigate the randomized decision tree complexity of a specific cla...

Please sign up or login with your details

Forgot password? Click here to reset