The well-known Sensitivity Conjecture regarding combinatorial complexity measures on Boolean functions states that for any Boolean function f : {0, 1} → {0, 1}, block sensitivity of f is polynomially related to sensitivity of f (denoted by s(f)). From the complexity theory side, the Xor Log-Rank Conjecture states that for any Boolean function, f : {0, 1… (More)