An algorithm for random signed 3-SAT with Intervals

Kathrin Ballerstein, Dirk Oliver Theis

In signed k-SAT problems, one fixes a set M and a set $\mathcal{S}$ of subsets of M, and is given a formula consisting of a disjunction of m clauses, each of which is a conjunction…