A Reply to "On Salum's Algorithm for X3SAT"
This paper is a reply to "On Salum's Algorithm for X3SAT" (arXiv:2104.02886)
cs.CC↗
arXiv subjects
Latif Salum
Publications and source records attributed to Latif Salum.
The Complexity of X3SAT: P = NP = PSPACE
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
cs.CC↗
On the Tractability of Un/Satisfiability
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 leads to some reductions of clauses by means of "exactly-1 disjunction". The reductions result in a conjunction of literals, called the scope of the assignment. It is proved that this particular truth assignment makes the formula unsatisfiable iff the scope_s is unsatisfiable for some s, which is trivial to check. Then, each literal such that its scope is unsatisfiable is removed from the formula. Therefore, the formula is satisfiable iff the scope of every literal is satisfied.
cs.CC↗