An exact algorithm for 1-in-3 SAT

TL;DR

This paper introduces an exact algorithm for the NP-complete 1-in-3 SAT problem, achieving a runtime of O*(1.260^n), advancing the computational approach to this logical satisfiability variant.

Contribution

The paper presents a novel exact algorithm for 1-in-3 SAT with a significantly improved exponential runtime bound.

Findings

Algorithm solves 1-in-3 SAT in O*(1.260^n) time

Provides a new upper bound for the problem's complexity

Advances computational methods for logical satisfiability problems

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^*(1.260^n)$.