We show that this decision problem is coNP - complete
and , <*> a formula admits a decomposition of exponential size in the worst case .
We show that this decision problem is coNP - complete and , when monadically decomposable , a formula admits a decomposition of exponential size in the worst case .
We show that this decision problem is coNP - complete and , when monadically decomposable , a formula admits a decomposition of exponential size in the worst case .