A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions

02/25/2020
by   Shalev Ben-David, et al.
0

We prove two new results about the randomized query complexity of composed functions. First, we show that the randomized composition conjecture is false: there are families of partial Boolean functions f and g such that R(f∘ g)≪ R(f) R(g). In fact, we show that the left hand side can be polynomially smaller than the right hand side (though in our construction, both sides are polylogarithmic in the input size of f). Second, we show that for all f and g, R(f∘ g)=Ω(noisyR(f)· R(g)), where noisyR(f) is a measure describing the cost of computing f on noisy oracle inputs. We show that this composition theorem is the strongest possible of its type: for any measure M(·) satisfying R(f∘ g)=Ω(M(f)R(g)) for all f and g, it must hold that noisyR(f)=Ω(M(f)) for all f. We also give a clean characterization of the measure noisyR(f): it satisfies noisyR(f)=Θ(R(f∘ gapmaj_n)/R(gapmaj_n)), where n is the input size of f and gapmaj_n is the √(n)-gap majority function on n bits.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2018

A composition theorem for randomized query complexity via max conflict complexity

Let R_ϵ(·) stand for the bounded-error randomized query complexity with ...
research
01/10/2018

A Composition Theorem via Conflict Complexity

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

A note on the tight example in On the randomised query complexity of composition

We make two observations regarding a recent tight example for a composit...
research
02/25/2020

A New Minimax Theorem for Randomized Algorithms

The celebrated minimax principle of Yao (1977) says that for any Boolean...
research
10/20/2020

Sparse reconstruction in spin systems I: iid spins

For a sequence of Boolean functions f_n : {-1,1}^V_n⟶{-1,1}, defined on ...
research
08/26/2022

Randomised Composition and Small-Bias Minimax

We prove two results about randomised query complexity R(f). First, we i...
research
01/07/2018

On the randomised query complexity of composition

Let f⊆{0,1}^n×Ξ be a relation and g:{0,1}^m→{0,1,*} be a promise functio...

Please sign up or login with your details

Forgot password? Click here to reset