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

Vladimir Podolskii, Dmitrii Sluch

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 >>>