Skip to Main content Skip to Navigation
Journal articles

The complexity of some complementation problems

David Plaisted 1 Gregory Kucherov 2
2 POLKA - Polynomials, Combinatorics, Arithmetic
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Journal articles
Complete list of metadata
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:39:15 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM


  • HAL Id : inria-00098851, version 1



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



Record views