Solving the Cubic Monotone 1-in-3 SAT Problem in Polynomial Time
Keywords:
exact 3-satisfiability; cubic Monotone 1-in-3 SAT; K6 free graph; polynomial time; P vs NP
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
Downloads
How to Cite
![Solving the Cubic Monotone 1-in-3 SAT Problem in Polynomial Time](https://computerresearch.org/public/journals/1/1-solving-the-cubic-monotone-thumbnail.jpg)
Published
2024-01-04
Issue
Section
License
Copyright (c) 2023 Authors and Global Journals Private Limited
![Creative Commons License](http://i.creativecommons.org/l/by/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution 4.0 International License.