4 ms·
almost is very far from done. If you have REALLY done it then probably somebody else might do it as well in the (not so) near future. Also, what is the degree
by mitko 17y ago
almost is very far from done. If you have REALLY done it then probably somebody else might do it as well in the (not so) near future.
Also, what is the degree of the polynomial solution? If it is high then fast approximate solution might be preferable to exact slower solution (example: Simplex vs. Ellipsoid algorithms for LP) . If the solution is not linear or quadratic the most this hugely decreases your potential market.
If I am at such position I would look at problems for which I can beat precision/time for approximate algorithms.
- mariorz 17y agoI've edited out "almost", I meant to use it as qualifying the "stumbled upon" part, not the algorithm. In any case by fast polynomial solution I meant one with a low degree. Let's assume this algorithm is as fast as existing approximate ones.
- mitko 17y agook then. This shifts the hard part of the problem from "how do I make this run in a lifetime", to "how do I reduce this problem to 3SAT efficiently". This seems to be related: http://en.wikipedia.org/wiki/P_%3D_NP_problem#Consequences_of_proof http://en.wikipedia.org/wiki/P_%3D_NP_problem#Consequences_o...