# A Composition Theorem for Randomized Query Complexity

@inproceedings{Anshu2017ACT,
title={A Composition Theorem for Randomized Query Complexity},
author={Anurag Anshu and Dmitry Gavinsky and Rahul Jain and Srijita Kundu and Troy Lee and Priyanka Mukhopadhyay and Miklos Santha and Swagato Sanyal},
booktitle={Electronic Colloquium on Computational Complexity},
year={2017}
}
Let the randomized query complexity of a relation for error probability $\epsilon$ be denoted by $R_\epsilon(\cdot)$. We prove that for any relation $f \subseteq \{0,1\}^n \times \mathcal{R}$ and Boolean function $g:\{0,1\}^m \rightarrow \{0,1\}$, $R_{1/3}(f\circ g^n) = \Omega(R_{4/9}(f)\cdot R_{1/2-1/n^4}(g))$, where $f \circ g^n$ is the relation obtained by composing $f$ and $g$. We also show that \$R_{1/3}\left(f \circ \left(g^\oplus_{O(\log n)}\right)^n\right)=\Omega(\log n \cdot R_{4/9}(f… CONTINUE READING
2

#### Citations

##### Publications citing this paper.
SHOWING 1-2 OF 2 CITATIONS

## A Composition Theorem via Conflict Complexity

• Swagato Sanyal
• Mathematics, Computer Science
• Electronic Colloquium on Computational Complexity
• 2018
VIEW 10 EXCERPTS
CITES BACKGROUND

## A composition theorem for randomized query complexity via max conflict complexity

• Mathematics, Computer Science
• ICALP
• 2018

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 12 REFERENCES

## Improved direct product theorems for randomized query complexity

• Andrew Drucker
• Computer Science, Mathematics
• 2011 IEEE 26th Annual Conference on Computational Complexity
• 2010
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

## Randomized Query Complexity of Sabotaged and Composed Functions

• Computer Science, Mathematics
• Theory of Computing
• 2018
VIEW 1 EXCERPT

## Query-to-Communication Lifting for BPP

• Computer Science, Mathematics
• 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
VIEW 2 EXCERPTS

## Simulation Theorems via Pseudo-random Properties

• Mathematics, Computer Science
• computational complexity
• 2017
VIEW 1 EXCERPT

## Structure of Protocols for XOR Functions

• Mathematics, Computer Science
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
VIEW 1 EXCERPT

## A Composition Theorem for Conical Juntas

• Mathematics, Computer Science
• Electronic Colloquium on Computational Complexity
• 2015
VIEW 2 EXCERPTS

## Deterministic Communication vs. Partition Number

• Mathematics, Computer Science
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
VIEW 2 EXCERPTS

## A Composition Theorem for Parity Kill Number

• Mathematics, Computer Science
• 2014 IEEE 29th Conference on Computational Complexity (CCC)
• 2013
VIEW 1 EXCERPT

VIEW 1 EXCERPT

## Dual lower bounds for approximate degree and Markov-Bernstein inequalities

• Mathematics, Computer Science
• Inf. Comput.
• 2013
VIEW 1 EXCERPT