The complexity of some complementation problems

David Plaisted (1) , Gregory Kucherov (2)

1 Department of Computer Science [Santa Barbara]
2 POLKA - Polynomials, Combinatorics, Arithmetic

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.

Mots clés: term; ground term; ground instance; complement representation; représentation du complément; complexité; computational complexity; terme

Domaines: Autre [cs.OH]

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