Randomised Composition and Small-Bias Minimax

08/26/2022
by   Shalev Ben-David, et al.
0

We prove two results about randomised query complexity R(f). First, we introduce a "linearised" complexity measure LR and show that it satisfies an inner-optimal composition theorem: R(f∘ g) ≥Ω(R(f) LR(g)) for all partial f and g, and moreover, LR is the largest possible measure with this property. In particular, LR can be polynomially larger than previous measures that satisfy an inner composition theorem, such as the max-conflict complexity of Gavinsky, Lee, Santha, and Sanyal (ICALP 2019). Our second result addresses a question of Yao (FOCS 1977). He asked if ϵ-error expected query complexity R̅_ϵ(f) admits a distributional characterisation relative to some hard input distribution. Vereshchagin (TCS 1998) answered this question affirmatively in the bounded-error case. We show that an analogous theorem fails in the small-bias case ϵ=1/2-o(1).

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
02/25/2020

A New Minimax Theorem for Randomized Algorithms

The celebrated minimax principle of Yao (1977) says that for any Boolean...
research
07/08/2023

A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers

We prove a strong composition theorem for junta complexity and show how ...
research
01/10/2018

A Composition Theorem via Conflict Complexity

Let (·) stand for the bounded-error randomized query complexity. We show...
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...
research
08/02/2019

Optimal Separation and Strong Direct Sum for Randomized Query Complexity

We establish two results regarding the query complexity of bounded-error...
research
07/06/2020

KRW Composition Theorems via Lifting

One of the major open problems in complexity theory is proving super-log...

Please sign up or login with your details

Forgot password? Click here to reset