Congratulation to Andrei Krokhin and Danny Vagnozzi on their Track B paper: Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard!
Congratulation to Andrei Krokhin and Danny Vagnozzi on their Track B paper: Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard!