HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

The Complexity of Some Complementation Problems

David 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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00072990
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:31:41 AM
Last modification on : Friday, February 4, 2022 - 3:11:18 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:30:31 PM

Identifiers

  • HAL Id : inria-00072990, version 1

Collections

Citation

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

Share

Metrics

Record views

77

Files downloads

143