On the NP-Hardness of Max-Not-2
From MaRDI portal
Publication:3167394
DOI10.1007/978-3-642-32512-0_15zbMath1294.68084OpenAlexW2898230027WikidataQ56958799 ScholiaQ56958799MaRDI QIDQ3167394
Publication date: 2 November 2012
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_15
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: On the NP-Hardness of Max-Not-2
