An exact algorithm for 1-in-3 SAT
classification
💻 cs.CC
keywords
algorithmexactin-3satisfiedclauseexactlyhereliteral
read the original 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)$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.