Randomized Query Complexity of Sabotaged and Composed Functions

THEORY OF COMPUTING, pp. 1-27, 2018.

Cited by: 14|Views25
EI

Abstract:

We study the composition question for bounded-error randomized query complexity: Is R(f circle g) = Omega(R(f) R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Theta(logR(g)), in between f and g allows us to prove R(f circle h circle g) = Omega(R(f) R(h) R(g)). We ...More

Code:

Data:

Your rating :
0

 

Tags
Comments