Abstract
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.
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.
No Figures found in article.
Omar Kettani. 2026. “. Global Journal of Computer Science and Technology – A: Hardware & Computation GJCST-A Volume 23 (GJCST Volume 23 Issue A1): .
Crossref Journal DOI 10.17406/gjcst
Print ISSN 0975-4350
e-ISSN 0975-4172
A Comparative Study of the Effeect of Promotion on Employee
The Problem Managing Bicycling Mobility in Latin American Cities: Ciclovias
Impact of Capillarity-Induced Rising Damp on the Energy Performance of
Liver Disease Prediction using Machine Learning Algorithms Home > GJCST
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.
