Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > DMITRII SLUCH:
All reports by Author Dmitrii Sluch:

TR23-157 | 31st October 2023
Vladimir Podolskii, Dmitrii Sluch

One-Way Communication Complexity of Partial XOR Functions

Revisions: 1

Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y) = f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for allowing Fourier analytic technique. For total XOR functions it is known ... more >>>




ISSN 1433-8092 | Imprint