AI Chat AI Image Generator AI Video AI Music Generator

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

09/04/2018

∙

by Yaqiao Li, et al.

∙

∙

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.

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 ...

0 Dmitry Gavinsky, et al. ∙

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...

0 Dmitry Gavinsky, et al. ∙

research

∙ 02/25/2020

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

We prove two new results about the randomized query complexity of compos...

0 Shalev Ben-David, et al. ∙

research

∙ 08/02/2017

Quadratically Tight Relations for Randomized Query Complexity

Let f:{0,1}^n →{0,1} be a Boolean function. The certificate complexity C...

0 Dmitry Gavinsky, et al. ∙

research

∙ 02/25/2020

A New Minimax Theorem for Randomized Algorithms

The celebrated minimax principle of Yao (1977) says that for any Boolean...

0 Shalev Ben-David, et al. ∙

research

∙ 01/15/2001

Multiple-Size Divide-and-Conquer Recurrences

This short note reports a master theorem on tight asymptotic solutions t...

0 Ming-Yang Kao, et al. ∙

research

∙ 04/14/2020

The quantum query complexity of composition with a relation

The negative weight adversary method, ADV^±(g), is known to characterize...

0 Aleksandrs Belovs, et al. ∙