The Complexity of X3SAT: P = NP = PSPACE

Salum L.

arxiv, vol.0, pp.1-12, 2022 (Non Peer-Reviewed Journal) identifier

  • Publication Type: Article / Article
  • Volume: 0
  • Publication Date: 2022
  • Journal Name: arxiv
  • Journal Indexes: Computer & Applied Sciences
  • Page Numbers: pp.1-12
  • Dokuz Eylül University Affiliated: Yes

Abstract

This paper shows that P = NP = PSPACE. It also tackles Graph Isomorphism.