The complexity of some complementation problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Information Processing Letters Year : 1999

The complexity of some complementation problems


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.
No file

Dates and versions

inria-00098851 , version 1 (26-09-2006)


  • HAL Id : inria-00098851 , version 1


David Plaisted, Gregory Kucherov. The complexity of some complementation problems. Information Processing Letters, 1999, 71 (3-4), pp.159-165. ⟨inria-00098851⟩
42 View
0 Download


Gmail Facebook Twitter LinkedIn More