I think this is a valid question for this forum (although maybe more suited to CS-SE or CSTheory-SE), but the wording (“huge time to solve”, “maybe in years”) is clumsy at best. Interpreted as “what would be some consequences of a QP algorithm for an NP-complete problem?” (e.g. does the poly hierarchy collapse?), it is fine. Some relevant answers to similar questions have been provided here and here.
↧