%0 Journal Article
%T An exact algorithm for 1-in-3 SAT
%A ¨¦douard Bonnet
%A Vangelis Th. Paschos
%J Computer Science
%D 2013
%I arXiv
%X 1-in-3 SAT is an NP-complete variant of 3-SAT\ where a "clause" is satisfied iff exactly one of its three literal is satisfied. We present here an exact algorithm solving \oit\ in time $O^*(1.260^n)$.
%U http://arxiv.org/abs/1307.5776v2