# On Uniform Reductions between Direct Product and XOR Lemmas

@article{Jaiswal2014OnUR, title={On Uniform Reductions between Direct Product and XOR Lemmas}, author={Ragesh Jaiswal}, journal={ArXiv}, year={2014}, volume={abs/1404.5169} }

There is a close connection between Direct Product and XOR lemmas in the sense that in many settings, we can prove one given the other. The known reductions that are used for the above purpose are either in the non-uniform setting or give non-matching parameters. By non-matching parameter we mean that $k$-wise Direct Product lemma implies $k'$-wise XOR lemma (and vice versa) for $k \neq k'$. In this work, we discuss reductions between $k$-wise Direct Product and $k$-wise XOR lemmas. That is, we… CONTINUE READING

#### Topics from this paper.

One Citation

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 23 REFERENCES

Uniform direct product theorems: simplified, optimized, and derandomized

- Computer Science, Mathematics
- 2008

75

A Probabilistic Inequality with Applications to Threshold Direct-Product Theorems

- Mathematics, Computer Science
- 2009

20

Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols

- Mathematics, Computer Science
- 2008

70

Approximately List-Decoding Direct Product Codes and Uniform Hardness Amplification

- Mathematics, Computer Science
- 2006

28

P = BPP if E requires exponential circuits: derandomizing the XOR lemma

- Mathematics, Computer Science
- 1997

524