Can you provide a hash functions $F(x) | F(x) = F(\overline{x}), x \in {\{0;1\}}^n$$\overline{x} $ is $x$ where all bits are swapped: $0 \rightarrow 1, 1 \rightarrow 0$Basically it will help me improve my MAX-CUT algorithm
Symmetric hash function
optimization
If $F(x)$ is a non-symmetric hash, you can always make it symmetric by defining $F'(x) = F(x) + F(\tilde x)$ where $+$ can be any symmetric operation (bitwise xor, for example).