Possibility of Proving P = NP through the 3-Partition Problem

Glenn Patrick King Ang
The P versus NP problem is a very intriguing concept as it asks whether difficult problems have an alternative easier solution, but the difficulty of a problem usually only exist from the perspective of the solver. This paper details an alternative method to efficiently solve a 3-partition problem, which is considered a strongly NP-complete problem. Thus, proving that there exists an efficient method to solve a 3-partition problem might also prove P = NP. Section...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.