4 ms·
Interesting, are you aware of any such algorithm (proven to exist but not discovered yet)?
by mixedbit 13y ago
Interesting, are you aware of any such algorithm (proven to exist but not discovered yet)?
- philix001 13y agoThere 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. http://en.wikipedia.org/wiki/Upper_and_lower_bounds http://en.wikipedia.org/wiki/Upper_and_lower_bounds
- anonymoushn 13y agoA bit more weakly, some algorithms are known but do not have any implementations. I believe this is the case for the algorithm from "Triangulating a Simple Polygon in Linear Time".