In one standard form, the Håstad switching lemma says that if is a -DNF and is a random restriction that independently leaves each variable unset with probability and otherwise assigns it a uniform Boolean value, then
The dual statement exchanges DNF and CNF. Thus a small-width DNF becomes, with high probability, a shallow decision tree and hence a small-width CNF after a sufficiently sparse random restriction.

Articles by others on the same topic (0)

There are currently no matching articles.