global-journal-of-computer-science-and-technology-a-hardware-computation
Global Journal of Computer Science and Technology - A: Hardware & Computation
0975-4350
0975-4172
Global Journals Publishing Group Incorporated
54690
Solving the Cubic Monotone 1-in-3 SAT Problem in Polynomial Time
Analyzing X3SAT Satisfiability via Graph Theory
KettaniOmar
MOROCCO, Mohammed V University - Scientific Institute
04
01
2024
23
A1
1
10
Abstract not found
exact 3-satisfiability; cubic Monotone 1-in-3 SAT; K6 free graph; polynomial time; P vs. NP.
Full Text
The exact 3-satisfiability problem (X3SAT) is known to remain NP-complete when restricted to expressions where every variable has exactly three occurrences, even in the absence of negated variables (Cubic Monotone 1-in-3 SAT Problem). The present paper shows that the Cubic Monotone 1-in-3 SAT Problem can be solved in polynomial time and, therefore prove that the conjecture P=NP holds.