Re:P might be NP: A Polynomial Time Algorithm for the Hamilt...
by philix001 on Wednesday May 29, 2013 @01:33PM
(#5787725)
There are cases where the lower bound to solve some problems (e.g. sorting) have been proved to be less than any known algorithm at the time.
If you prove that the lower bound for any NP-Complete problem is O(p) where p is a polynomial, then P=NP and you do not necessarily have the algorithm.
If you prove that the lower bound for any NP-Complete problem is O(p) where p is a polynomial, then P=NP and you do not necessarily have the algorithm.
http://en.wikipedia.org/wiki/Upper_and_lower_bounds