The NP-completeness column
From MaRDI portal
Publication:4962719
DOI10.1145/1159892.1159901zbMath1442.68066OpenAlexW2018451329WikidataQ130976121 ScholiaQ130976121MaRDI QIDQ4962719
No author found.
Publication date: 5 November 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1159892.1159901
lower boundscliqueapproximation algorithmsprobabilistically checkable proofsset coverunique games conjecturelabel cover
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: The NP-completeness column