The NP-completeness column: An ongoing guide
From MaRDI portal
Publication:5903066
DOI10.1016/0196-6774(85)90046-XzbMath0588.68020OpenAlexW4251870981MaRDI QIDQ5903066
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90046-x
Related Items (9)
Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete ⋮ More complicated questions about maxima and minima, and some closures of NP ⋮ Complexity of DNA sequencing by hybridization. ⋮ Classifying the computational complexity of problems ⋮ On the approximability of the simplified partial digest problem ⋮ Computational complexity of isothermic DNA sequencing by hybridization ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ Shortest Two Disjoint Paths in Polynomial Time ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: The NP-completeness column: An ongoing guide
