1 problem

The variable bound conjecture for minimally unsatisfiable $k$ -DNF sets
Variable bound conjecture. Suppose that ${\mathbb{D}}$ is a minimally unsatisfiable $k$ -DNF set for some arbitrary but fixed positive integer $k$ . Then the number of variables in…
opendnf-resolution proof-complexity satisfiability
0 responses
03

The variable bound conjecture for minimally unsatisfiable kkk-DNF sets