Somewhat tired as you are of the academic community, and not very interested in prizes or distinctions, you decide it would be in your best interest to try to monetize your discovery privately. To this purpose, what massively lucrative applications can you think of for such an algorithm?
Ask HN: P=NP, what do you do?
1–10 of 70 posts
Re: Ask HN: P=NP, what do you do?
#2Re: Ask HN: P=NP, what do you do?
#3if you really want to give a finger to the academia though, just publish it - and include a long essay on all the various ways the academic institutions hindered your progress, how bureaucratic they are, and how little they actually care about advancing knowledge. further, publish it on a blog instead of an academic journal, ask for peer review, and don't mention your university once anywhere on the blog. that'll show 'em, those punks.
Re: Ask HN: P=NP, what do you do?
#4On the other hand, since it is more likely that P!=NP, this "almost" algorithm probably fails exponentially on some set of examples, and in practice there are plenty of NP complete problems which enjoy very good approximation algorithms or heuristic algorithms which work well for typical problem instances.
Re: Ask HN: P=NP, what do you do?
#5Edit: Who I am kidding, the Americans would not want the other countries to know P=NP and talking to anyone else would be grounds for disappearance. So there would be no bidding war, you'd have to take what you can get from the NSA/CIA. Anything less than 1M a year for life would be insulting and they know that.
Re: Ask HN: P=NP, what do you do?
#6There's also the UPS/Fedex route - which isn't worth as much money, but you could sell them a black box that does fast routing for money.
Re: Ask HN: P=NP, what do you do?
#7If you have an algorithm with a worst case polynomial bound on the time it takes to solve an NP complete problem, then UPS, Fedex and other companies would pay nicely to use a service to optimally do scheduling, routing and resource allocation. On the other hand, since it is more likely that P!=NP, this "almost" algorithm probably fails exponentially on some set of examples, and in practice there are plenty of NP com…
Re: Ask HN: P=NP, what do you do?
#8Make my salesmen travel more efficiently?
Re: Ask HN: P=NP, what do you do?
#9Also, 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.