We apply both techniques to show that entangled graph k-colouring is undecidable for all k >= 3. Famously, XOR games, which correspond to the CSP of boolean linear equations with two variables per ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results