For questions related to the XOR problem, i.e. the problem of computing/approximating the XOR logical function, i.e. a function $f: \{0, 1\}^2 \rightarrow \{0, 1\} $ that returns 1 only when the two bits are different and 0 otherwise, i.e. $f(a, b) = 1 \iff a \neq b$ and $a, b \in \{0, 1\}$.

There is no tag wiki for this tag … yet!

Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.

All registered users may propose new tag wikis.

(Note that if you have less than 4000 reputation, your tag wiki will be peer reviewed before it is published.)