Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > HARIHARAN SRINIVASULU:
All reports by Author Hariharan Srinivasulu:

TR20-124 | 3rd August 2020
Joshua Brody, JaeTak Kim, Peem Lerdputtipongporn, Hariharan Srinivasulu

A Strong XOR Lemma for Randomized Query Complexity

We give a strong direct sum theorem for computing $XOR \circ g$. Specifically, we show that the randomized query complexity of computing the XOR of $k$ instances of $g$ satisfies $\bar{R}_\varepsilon(XOR \circ g)=\Theta(\bar{R}_{\varepsilon/k}(g))$. This matches the naive success amplification bound and answers a question of Blais and Brody.

As a ... more >>>




ISSN 1433-8092 | Imprint