The Complexity of Some Complementation Problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1999

The Complexity of Some Complementation Problems

David A. Plaisted
  • Function : Author

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.
Fichier principal
Vignette du fichier
RR-3681.pdf (229.66 Ko) Télécharger le fichier

Dates and versions

inria-00072990 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072990 , version 1

Cite

David A. Plaisted, Gregory Kucherov. The Complexity of Some Complementation Problems. [Research Report] RR-3681, INRIA. 1999, pp.15. ⟨inria-00072990⟩
78 View
155 Download

Share

Gmail Facebook X LinkedIn More