Are there any problems that used to be in NP (not NP-complete and not P) but since then have been proven to be in P? I saw this video which states that people sometimes find ways of doing NP problems as quickly as P, thus proving that the problem is actually in P. Does anyone know of any examples?
Asked
Active
Viewed 106 times
0
-
1This really belongs on the CS Stack Exchange, but approximate solution of linear programs is a pretty good example. – David Eisenstat Aug 22 '15 at 13:49
-
1Also primality test ([2002](https://en.wikipedia.org/wiki/AKS_primality_test)). – Juan Lopes Aug 22 '15 at 13:56
-
I thought NP to be a proper superset of P - ? – greybeard Aug 22 '15 at 18:35
-
1NP is a superset of P, but it is not known whether or not it's a proper superset. That's the whole point of that P vs NP thing. – Juan Lopes Aug 22 '15 at 18:57