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

Details A new point of NP-hardness for 2-to-1 Label Cover A new point of NP-hardness for 2-to-1 Label Cover

2012-04-25

arxiv.org/abs/1204.5666v1

Computer Science

Computational Complexity

Scientific paper

We show that given a satisfiable instance of the 2-to-1 Label Cover problem,
it is NP-hard to find a $(23/24 + \eps)$-satisfying assignment.

Affiliated with

Also associated with

No associations

Rating

A new point of NP-hardness for 2-to-1 Label Cover does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new point of NP-hardness for 2-to-1 Label Cover, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new point of NP-hardness for 2-to-1 Label Cover will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138893