A Kernel Method for Positive 1-in-3-SAT

08/08/2018

∙

by   Valentin Bura, et al.

∙

0

∙

share

This paper illustrates the power of Gaussian Elimination by adapting it to Positive 1-in-3-SAT. We derive a general kernelization method for this problem and thus obtain an upper bound for the complexity of its counting version of O(2kR 2^(1-k)R) for number of variables R and clauses-to-variables ratio k. Combining this method with previous results gives a time and space complexity for the counting problem of O(4/3|V|2^3|V|/8) and O(4/3|V|2^3|V|/16).