The NP-completeness column: An ongoing guide

DOI10.1016/0196-6774(88)90033-8MaRDI QIDQ5903717zbMATH OpenOpenAlexFDO

Authors D. S. Johnson

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90033-8

zbMATH Keywords

NP-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: an ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide

Cited in

(12)

• The NP-completeness column
• Hamiltonian properties of some compound networks
• The NP-completeness column: an ongoing guide
• The NP-completeness column: An ongoing guide
• Polynomial-time instances of the minimum weight triangulation problem
• A term equality problem equivalent to graph isomorphism
• Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete
• A brief history of NP-completeness, 1954--2012
• The NP-completeness column: An ongoing guide
• Fractional Strong Matching Preclusion for DHcube
• The NP-completeness column: An ongoing guide
• The NP-completeness column: An ongoing guide

This page was built for publication: The NP-completeness column: An ongoing guide

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5903717)