20210530, 22:45  #1 
"Viliam Furík"
Jul 2018
Martin, Slovakia
2C6_{16} Posts 
What might really happen if P=NP?
Hi, I have been recently interested in this topic. Together with my schoolmate, we may have found an algorithm to solve an NPcomplete problem, but nothing is sure for now, so I won't go into much detail about it, except that it should be able to determine the solvability of the said problem in O(n^{6}) and find a solution in O(n^{12})  take the Otimes with a grain of salt, I may have made a mistake when determining them.
So my question is: How much of use (and in which areas of science and life) would this algorithm have if it turned out to be correct? I heard and read about GPS navigation ride routing, for example. How big and complicated of a ride would need to be planned in order for it to benefit from the algorithm? 
20210530, 23:00  #2  
"Robert Gerbicz"
Oct 2005
Hungary
7^{2}·31 Posts 
Quote:
And instead of you I'd stick to these problems. Who knows you could destroy the remaining problems also. 

20210530, 23:09  #3 
"Viliam Furík"
Jul 2018
Martin, Slovakia
2·5·71 Posts 
Yes, I know there is a 1M $ prize for its head... But I also know that it can be awarded after two years from publishing. So I wanted to ask about its real use as an algorithm. There are many claims that if P=NP every difficult task will get easy and life will become topical, basically. I want to find out, how close it is to the truth, or how far from it.

20210530, 23:18  #4 
Mar 2019
205_{10} Posts 
Your question presupposes that the proof will be constructive, i.e. that it shows how to take a problem in NP and solve in polynomial time.
It could be that someone proves P=NP but the proof does not provide sufficient information for transforming a problem in NP to an equivalent in P. 
20210530, 23:26  #5  
If I May
"Chris Halsall"
Sep 2002
Barbados
10011101000100_{2} Posts 
Quote:
"Umm... OK... Let's start with the basics... Just how many qubits do you need to represent the problem? The silence generally starts about there and then continues for all the following questions... 

20210530, 23:40  #6 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2×23×137 Posts 
Proving P=NP in no way guarantees you can then find P algorithms for all NP problems. Maybe you could, maybe you couldn't. It depends upon the nature of the proof.
All it would say is that an algorithm exists. It might not say how to find it. It is even possible that someone could prove P=NP, but still no one can find any algorithm to solve any NP problem in P time. You appear to have the opposite. You have an NP problem and a P solution. And if true then great ... for that problem. But would it lead to solving all other NP problems? Only you can tell us by explaining what you have. 
20210531, 08:30  #7  
"Viliam Furík"
Jul 2018
Martin, Slovakia
2·5·71 Posts 
Quote:
I prefer to keep my algorithm for myself (mainly because I don't want to act like the few forum users which come here to shove their "discoveries" down our throats) until I and my schoolmate meet with a few people from Comenius University in Bratislava, where I am also going to study. 

20210531, 19:24  #8  
If I May
"Chris Halsall"
Sep 2002
Barbados
2^{2}·7·359 Posts 
Quote:
But if you haven't, it will be a *big* deal. Edit: A bit of learned levity... Two economists are walking down the street. One asks the other "Is that a 20pound note just laying there in the street?" The other economist answers immediately without even looking: "No. Of course not! Or else someone else would have already picked it up. Last fiddled with by chalsall on 20210531 at 19:29 

20210720, 22:10  #9 
"Viliam Furík"
Jul 2018
Martin, Slovakia
2·5·71 Posts 
I have a few updates on this topic.
1. The proof of correctness for the algorithm is not as correct as I thought... But it's incorrect in a way that the proof for one key aspect of the algorithm is missing, which still allows the possibility of it being true, but it's hard to say for sure without good proof. 2. Meanwhile, a friend of our friend helped us find a counterexample, in which the algorithm failed. It was basically a type of infinitely many counterexamples. But we have managed to quickly patch it up by adding a feature (basically errorcheck), which we actually considered in the creation process, but thought it can not be done in polynomial time, so we ignored it. Turns out, it is doable in polynomial time... So far, we haven't come up with another counterexample. We are trying to find proof of correctness or another counterexample, but so far no luck with either. So if there is someone with enough free time and willing to help, we will be happy to have another helping hand (brain, actually). The problem the algorithm is solving is Generalised Sudoku, i.e. Sudoku where the grid is made of n by n squares of n by n cells. The classic newspaper Sudoku is n=3. We have a working (the updated version works for all tested grids so far) implementation of the algorithm in Python, which is not a fast language, but it is the only one I know well enough and it's quite easy to make such implementations in it. If you are willing to help in any way, please, send me a PM. 
20210720, 23:32  #10 
Apr 2012
Gracie on alert.
2×7×29 Posts 
I recall reading somewhere that Stephen Wolfram wrote a 3 line Perl script that would solve Soduku..similar to a minesweeper script.
Along those lines, Dijkstra's algorithm  Wikipedia, Knuth, Kaye and a few others should have crossed your path regarding this investigation. Last fiddled with by jwaltos on 20210720 at 23:32 
20210721, 00:01  #11  
"Viliam Furík"
Jul 2018
Martin, Slovakia
1011000110_{2} Posts 
Quote:
Yes, they did. But none of them produced a general polynomialtime algorithm, as Wikipedia still states the problem is NPcomplete. 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
What are the most exciting things that can happen in order of likelihood?  EugenioBruno  Information & Answers  21  20200328 21:12 
What will happen?  RichardB  Information & Answers  16  20100903 21:25 
Which will happen first?  Uncwilly  Lounge  11  20050218 14:41 