Abstract: Majority-SAT (a.k.a. MAJ-SAT) is the problem of determining whether an input n-variable formula in conjunctive normal form (CNF) has at least 2^(n-1) satisfying assignments. Majority-SAT and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback