Algorithm that Solves 3-SAT in Polynomial Time

TL;DR

This paper claims to present an algorithm that solves the NP-complete 3-SAT problem in polynomial time, potentially implying P equals NP, which would be a groundbreaking breakthrough in computational complexity.

Contribution

The paper introduces a novel algorithm purported to solve 3-SAT in polynomial time, challenging the long-standing P vs NP problem.

Findings

Algorithm solves 3-SAT in polynomial time

Implication that P equals NP if the algorithm is correct

Potential breakthrough in computational complexity theory

Abstract

The question of whether the complexity class P is equal to the complexity class NP has been a seemingly intractable problem for over 4 decades. It has been clear that if an algorithm existed that would solve the problems in the NP class in polynomial time then P would equal NP. However, no one has yet been able to create that algorithm or to successfully prove that such an algorithm cannot exist. The algorithm that will be presented in this paper solves the 3-satisfiability or 3-CNF-SAT problem, which has been proven to be NP-complete.