Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style
icon Submit Paper


RSS-Feed
REPORTS > DETAIL:

Paper:

TR26-033 | 2nd March 2026 15:30

Simple XOR lemma

Contact
Add Comment
RSS-Feed




TR26-033 Authors: Emanuele Viola
Publication: 2nd March 2026 15:30
Downloads: 164
Keywords: 


Abstract:

I give an alternative proof of the xor lemma which may provide a simple explanation of why xor-ing decreases correlation.


ISSN 1433-8092 | Imprint