The NP-completeness column: An ongoing guide

DOI10.1016/0196-6774(90)90035-DzbMATH Open0694.68035OpenAlexW4242448640MaRDI QIDQ5899705FDOQ5899705

Authors: D. S. Johnson 

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90035-d

zbMATH Keywords

NP-completenessNP-hard problems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (2)

• On the computational complexity of ordered subgraph recognition
• A brief history of NP-completeness, 1954--2012

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 Q5899705)