On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem

Details On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem

2010-03-19

arxiv.org/abs/1003.3704v2

Computer Science

Computational Complexity

Scientific paper

In this paper we define a restricted version of Monotone NAE-3SAT and show
that it remains NP-Complete even under that restriction. We expect this result
would be useful in proving NP-Completeness results for problems on
$k$-colourable graphs ($k \ge 5$). We also prove the NP-Completeness of the
Triangle-Free Cut problem.

Affiliated with

Also associated with

No associations

Rating

On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem 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 On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353895