On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
Computational Complexity
2010-03-30 v2
Abstract
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 -colourable graphs (). We also prove the NP-Completeness of the Triangle-Free Cut problem.
Keywords
Cite
@article{arxiv.1003.3704,
title = {On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem},
author = {Peiyush Jain},
journal= {arXiv preprint arXiv:1003.3704},
year = {2010}
}