Efficient dualization of O(log n)-term monotone disjunctive normal

This paper shows that O(log n)-term monotone disjunctive normal forms (DNFs) ϕ can be dualized in incremental polynomial time, where n is the number of variables in ϕ. This improves upon the trivial result that k-term monotone DNFs can be dualized in polynomial time, where k is bounded by some constant.