For any (k,d)-CNF formula with a variable set V, is a proper subset of V, if a truth assignment set on exists such that only a literal in each clause is true, then it is the regular partial exact (k,d ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results