HackerPapers

arXiv:1110.1658cs.CC

Algorithm that Solves 3-SAT in Polynomial Time

Jason W. Steinmetz

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
This paper has been withdrawn by the author because the integer operations within the algorithm cannot be proven to have a polynomial run time
Journal reference
DOI
Subjects
cs.CCComputational Complexity

On Hacker News

No comments linking this paper were found in the collected sources. Found in 2 HN submissions from Oct 2011 to Oct 2011. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.