1 problem
- 0 votes0 replies1 view
Polynomial-time computation of autarkies beyond the lean minimum-degree bound
Let be a clause-set with deficiency surplus . Write for its minimum variable-degree and for…
Polynomial-time computation of autarkies beyond the lean minimum-degree bound
Let be a clause-set with deficiency surplus . Write for its minimum variable-degree and for…