Shalev, BenDavid ;
Kothari, Robin
Randomized Query Complexity of Sabotaged and Composed Functions
Abstract
We study the composition question for boundederror randomized query complexity: Is R(f circ g) = Omega(R(f)R(g))? We show that inserting a simple function h, whose query complexity is onlyTheta(log R(g)), in between f and g allows us to prove R(f circ h circ g) = Omega(R(f)R(h)R(g)).
We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f circ g) >= RS(f) RS(g), and a composition theorem with randomized query complexity, R(f circ g) = Omega(R(f) RS(g)). It is also a quadratically tight lower bound for total functions and can be quadratically superior to the partition bound, the best known general lower bound for randomized query complexity.
Using this technique we also show implications for lifting theorems in communication complexity. We show that a general lifting theorem from zeroerror randomized query to communication complexity implies a similar result for boundederror algorithms for all total functions.
BibTeX  Entry
@InProceedings{shalev_et_al:LIPIcs:2016:6223,
author = {BenDavid Shalev and Robin Kothari},
title = {{Randomized Query Complexity of Sabotaged and Composed Functions}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {60:160:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770132},
ISSN = {18688969},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6223},
URN = {urn:nbn:de:0030drops62233},
doi = {10.4230/LIPIcs.ICALP.2016.60},
annote = {Keywords: Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem}
}
2016
Keywords: 

Randomized query complexity, decision tree complexity, composition theorem, partition bound, lifting theorem 
Seminar: 

43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)

Issue date: 

2016 
Date of publication: 

2016 