# 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 function. This work investigates the randomised query complexity of the relation f∘ g^n⊆{0,1}^m· n×Ξ, which can be viewed as one of the most general cases of composition in the query model (letting g be a relation seems to result in a rather unnatural definition of f∘ g^n). We show that for every such f and g, R(f∘ g^n) ∈Ω( R(f)·√( R(g))), where R denotes the randomised query complexity. On the other hand, we demonstrate a relation f_0 and a promise function g_0, such that R(f_0)∈Θ(√(n)), R(g_0)∈Θ(n) and R(f_0∘ g_0^n)∈Θ(n) - that is, our composition statement is tight. To the best of our knowledge, there was no known composition theorem for the randomised query complexity of relations or promise functions (and for the special case of total functions our lower bound gives multiplicative improvement of √( n)).

READ FULL TEXT