The Complexity of Some Complementation Problems

David A. Plaisted Gregory Kucherov 1
1 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.
Type de document :
Rapport
[Research Report] RR-3681, INRIA. 1999, pp.15
Liste complète des métadonnées

https://hal.inria.fr/inria-00072990
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:31:41
Dernière modification le : mardi 6 mars 2018 - 17:40:58
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:30:31

Fichiers

Identifiants

  • HAL Id : inria-00072990, version 1

Collections

Citation

David A. Plaisted, Gregory Kucherov. The Complexity of Some Complementation Problems. [Research Report] RR-3681, INRIA. 1999, pp.15. 〈inria-00072990〉

Partager

Métriques

Consultations de la notice

132

Téléchargements de fichiers

127