On a variant of Monotone NAE-3SAT and the Triangle-Free Cut problem
نویسنده
چکیده
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 ≥ 5). We also prove the NPCompleteness of the Triangle-Free Cut problem.
منابع مشابه
k-Bounded Positive Not All Equal LE3-SAT
The not all equal (NAE) 3-SAT problem is known to be NP-complete even in the absence of negated variables (see [11]), a variant known as positive (or monotone) NAE 3-SAT. In this article, we investigate a related category, dubbed positive NAE LE3SAT (PNAE LE3-SAT), in which each clause has at most three variables, none of which is negated, and an assignment is sought that will satisfy such an e...
متن کاملSchwarz boundary problem on a triangle
In this paper, the Schwarz boundary value problem (BVP) for the inhomogeneous Cauchy-Riemann equation in a triangle is investigated explicitly. Firstly, by the technique of parquetingreflection and the Cauchy-Pompeiu representation formula a modified Cauchy-Schwarz representation formula is obtained. Then, the solution of the Schwarz BVP is explicitly solved. In particular, the boundary behavio...
متن کاملXSAT and NAE-SAT of linear CNF classes
XSAT and NAE-SAT are important variants of the propositional satisfiability problem (SAT). Both are studied here regarding their computational complexity of linear CNF formulas. We prove that both variants remain NP-complete for (monotone) linear formulas yielding the conclusion that also bicolorability of linear hypergraphs is NP-complete. The reduction used gives rise to the complexity invest...
متن کاملThe Complexity of Guarding Monotone Polygons
A polygon P is x-monotone if any line orthogonal to the x-axis has a simply connected intersection with P . A set G of points inside P or on the boundary of P is said to guard the polygon if every point inside P or on the boundary of P is seen by a point in G. An interior guard can lie anywhere inside or on the boundary of the polygon. Using a reduction fromMonotone 3SAT, we prove that interior...
متن کاملA Hybrid Proximal Point Algorithm for Resolvent operator in Banach Spaces
Equilibrium problems have many uses in optimization theory and convex analysis and which is why different methods are presented for solving equilibrium problems in different spaces, such as Hilbert spaces and Banach spaces. The purpose of this paper is to provide a method for obtaining a solution to the equilibrium problem in Banach spaces. In fact, we consider a hybrid proximal point algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1003.3704 شماره
صفحات -
تاریخ انتشار 2010