Approximating 1-In-3 SAT by Linearly Ordered Hypergraph 3-Colouring Is NP-Hard.

Andrei A. Krokhin, Danny Vagnozzi

Browse the full ICALP paper archive.