3 papers
cs.CC2022
A Reply to "On Salum's Algorithm for X3SAT"
Latif Salum
This paper is a reply to "On Salum's Algorithm for X3SAT" (arXiv:2104.02886)
cs.CC2020
The Complexity of X3SAT: P = NP = PSPACE
Latif Salum
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
cs.CC2014
On the Tractability of Un/Satisfiability
Latif Salum
This paper shows effectiveness of X3SAT in proving P = NP. This is due to the fact that it is easy to check unsatisfiability of a particular truth assignment. A truth assignment le…