Abstract : We study the computational complexity of the problem of computing a complement representation for a set of terms. Depending on the class of sets considered, some sets are shown to have an exponential complement representation in the worst case, and some are shown to have a polynomial one. The complexity of deciding if a set has an empty complement is also studied.
David Plaisted, Gregory Kucherov. The complexity of some complementation problems. Information Processing Letters, Elsevier, 1999, 71 (3-4), pp.159-165. ⟨inria-00098851⟩