An exact algorithm for 1-in-3 SAT

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 $O^{\ast }(1.260^n)$.

this paper has been withdrawn since there are better results already known. (Note that 1-in-3 SAT is also known as X3SAT)

References in corpus (1)

• Exponential Complexity of the Quantum Adiabatic Algorithm for certain Satisfiability Problems