Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT

Richard Denman, Stephen Foster. Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Applied Mathematics, 157(7):1655-1659, 2009. [doi]

Abstract

Abstract is missing.