1 paper
Andrei Krokhin, Danny Vagnozzi
Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not nec…