An exact algorithm for 1-in-3 SAT
Computational Complexity
2013-07-30 v2
Abstract
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 .
Keywords
Cite
@article{arxiv.1307.5776,
title = {An exact algorithm for 1-in-3 SAT},
author = {Édouard Bonnet and Vangelis Th. Paschos},
journal= {arXiv preprint arXiv:1307.5776},
year = {2013}
}
Comments
this paper has been withdrawn since there are better results already known. (Note that 1-in-3 SAT is also known as X3SAT)