Complexity of converting a propositional formula to disjunctive normal form

58 Views Asked by At

If $\varphi$ is a propositional formula, what is the complexity of the problem of converting $\varphi$ into an equivalent disjunctive normal form? What about an equisatisfiable disjunctive normal form? I see a variety of information online but none states the complexity class explicitely.