A New Point of NP-Hardness for 2-to-1 Label Cover

DOI10.1007/978-3-642-32512-0_1zbMath1358.68110arXiv1204.5666OpenAlexW1886734694MaRDI QIDQ3167380

No author found.

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://arxiv.org/abs/1204.5666

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover ⋮ The Maximum Binary Tree Problem. ⋮ The maximum binary tree problem

This page was built for publication: A New Point of NP-Hardness for 2-to-1 Label Cover