A new point of NP-hardness for 2-to-1 Label Cover [article]

Per Austrin and Ryan O'Donnell and John Wright
2012 arXiv   pre-print
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.
arXiv:1204.5666v1 fatcat:a5b4kdi6ojc7blmjtrbuqmpdei