The complexity of some complementation problems

DOI10.1016/S0020-0190(99)00102-7zbMath0999.68093OpenAlexW2015787029WikidataQ58064532 ScholiaQ58064532MaRDI QIDQ1606984

Gregory Kucherov, David Alan Plaisted

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00102-7

zbMATH Keywords

computational complexityset of terms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: The complexity of some complementation problems