The polynomial algorithm for 3-SAT problem (or P=NP)
romvf.wordpress.com
The polynomial algorithm for 3-SAT problem (or P=NP)
1–10 of 156 posts
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#2Why do we think this is worthy of voting up? Is there any reason to think it might be correct?
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#3OK, I just upvoted purely for the reason of keeping it on the front page a little longer so someone more qualified has a chance to glance at this. Without any evidence and no qualification to judge myself, it seems highly unlikely.
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#4Why do we think this is worthy of voting up? Is there any reason to think it might be correct?
It's on the arXive, so you know it's legit.
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#5I don't think one example constitutes a conclusion. While demonstrating the nonexistance of an algorithm for 3-SAT problem would prove P!=NP, the existance of an algorithm merely means "Move along, let's try a different difficult algorithm"
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#6lol
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#7Just this months there's another paper on arXive that uses 3-SAT to proove P!=NP http://arxiv.org/abs/1101.2018
A list of articles published on the P=NP debate is here http://www.win.tue.nl/~gwoegi/P-versus-NP.htm
Looks like someone thinks they've solved the problem every month or so :)
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#8Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#9I don't think one example constitutes a conclusion. While demonstrating the nonexistance of an algorithm for 3-SAT problem would prove P!=NP, the existance of an algorithm merely means "Move along, let's try a different difficult algorithm"
3-SAT isn't just NP, it's NP-Complete. So a solution for 3-SAT is also a solution for all other NP problems.
Re: The polynomial algorithm for 3-SAT problem (or P=NP)
#10I don't think one example constitutes a conclusion. While demonstrating the nonexistance of an algorithm for 3-SAT problem would prove P!=NP, the existance of an algorithm merely means "Move along, let's try a different difficult algorithm"
That's incorrect unless I'm misreading you. 3 SAT is NP-complete, which means that if this algorithm's polynomial performance holds up, you can generalize it to solve any problem in NP in poly time.