A new point of NP-hardness for 2-to-1 Label Cover
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.