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

09/04/2018
by   Yaqiao Li, et al.
0

We make two observations regarding a recent tight example for a composition theorem for randomized query complexity: (1) it implies general randomized query-to-communication lifting is not always true if one allows relations, (2) it is in a certain sense essential that a relation is used in constructing the example.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset