Skip to main content
Conference Proceedings

A new point of NP-hardness for 2-to-1 label cover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7408 LNCS 1-12
DOI: 10.1007/978-3-642-32512-0_1
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a (23/24 + ε)-satisfying assignment. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Austrin, P., O’Donnell, R., & Wright, J. (2012). A new point of NP-hardness for 2-to-1 label cover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7408 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-32512-0_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free