The Complexity of X3SAT: P = NP = PSPACE
Computational Complexity
2022-12-13 v8
Authors:
Latif Salum
Abstract
This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.
Cite
@article{arxiv.2012.06304,
title = {The Complexity of X3SAT: P = NP = PSPACE},
author = {Latif Salum},
journal= {arXiv preprint arXiv:2012.06304},
year = {2022}
}
Related papers
View all related →
Computational Complexity · Computer Science
A Polynomial Time Algorithm for SAT
Sergey Gubin
2012-05-08
Computational Complexity · Computer Science
Graph Isomorphism is PSPACE-complete
Matthew Delacorte
2007-08-31
Computational Complexity · Computer Science
Linear Planar 3-SAT and Its Applications in Planning
Victorien Desbois, Ocan Sankur, François Schwarzentruber
2025-06-18
Computational Complexity · Computer Science
The Complexity of 3SAT_N and the P versus NP Problem
Ruijia Liao
2013-11-12
Computational Complexity · Computer Science
The Linear Correlation of $P$ and $NP$
Bojin Zheng, Weiwu Wang
2023-03-08
Computational Complexity · Computer Science
Polarity and Monopolarity of $3$-colourable comparability graphs
Nikola Yolov
2016-04-06
Data Structures and Algorithms · Computer Science
A Polynomial time Algorithm for 3SAT
Lizhi Du
2026-04-23
Computational Complexity · Computer Science
Non-Interlaced SAT is in P
Dr Serge Burckel
2019-03-26
Computational Complexity · Computer Science
Complexity Aspects of Homomorphisms of Ordered Graphs
Michal Čertík, Andreas Emil Feldmann, Jaroslav Nešetřil, Paweł Rzążewski
2025-12-01
Computational Complexity · Computer Science
Algorithm that Solves 3-SAT in Polynomial Time
Jason W. Steinmetz
2015-06-04
Computational Complexity · Computer Science
P?=NP as minimization of degree 4 polynomial, integration or Grassmann number problem, and new graph isomorphism problem approaches
Jarek Duda
2022-10-25
Computational Complexity · Computer Science
P is a proper subset of NP
Jerrald Meek
2008-09-07
Computational Geometry · Computer Science
Finding Geometric Representations of Apex Graphs is NP-Hard
Dibyayan Chakraborty, Kshitij Gajjar
2021-06-03
Discrete Mathematics · Computer Science
Set graphs. II. Complexity of set graph recognition and similar problems
Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
2015-03-20
Computational Complexity · Computer Science
P = NP
Sergey V. Yakhontov
2017-03-21
Computational Complexity · Computer Science
On Salum's Algorithm for $\mathrm{X3SAT}$
Arian Nadjimzadah, David E. Narváez
2021-04-08
Combinatorics · Mathematics
Hypergraphic Degree Sequences are Hard
Antoine Deza, Asaf Levin, Syed M. Meesum, Shmuel Onn
2020-12-08
Artificial Intelligence · Computer Science
New Worst-Case Upper Bound for X3SAT
Junping Zhou, Minghao Yin
2011-03-29
Computational Complexity · Computer Science
On proof theory in computer science
L. Gordeev, E. H. Haeusler
2020-12-09
Data Structures and Algorithms · Computer Science
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
2015-03-19
Algebraic Topology · Mathematics
Higher analogs of simplicial and combinatorial complexity
Amit Kumar Paul
2019-05-07
Computational Complexity · Computer Science
NP-complete variants of some classical graph problems
Per Alexandersson
2020-01-14
Computational Geometry · Computer Science
Point visibility graph recognition is NP-hard
Bodhayan Roy
2016-05-05
Computational Complexity · Computer Science
A 3-CNF-SAT descriptor algebra and the solution of the P=NP conjecture
Marcel Rémon, Johan Barthélemy
2020-01-06
Computational Complexity · Computer Science
Complexity of Domination in Triangulated Plane Graphs
Dömötör Pálvölgyi
2017-09-05