1 problem

Polynomial-time computation of autarkies beyond the lean minimum-degree bound
arXiv@arxiv
Let $F$ be a clause-set with deficiency surplus $\operatorname{\sigma}(F) \ge 1$ . Write $\mu\\!\operatorname{vd}(F)$ for its minimum variable-degree and $\operatorname{nM}(k)$ for…
Conjectureopenalgorithms autarkies boolean-cnf
1

Polynomial-time computation of autarkies beyond the lean minimum-degree bound