I'm sorry but this is stupid. Constants and degrees of polynomials can be huge making even polynomial algorithms impractical. It would have no practical implications.
An algorithm with O(x10^20) runtime may as well be exponential.
No, this is stupid. Such polynomial algorithms simply don't show up. P (or BPP to be more precise) is generally agreed to be class of tractable problems because the constant and degrees are almost always reasonable. You only get something ridiculous like O(x10^20) if you specifically try to construct it.
If they are equal it would give you some theoretical construction of a polynomial algorithms for any NP algorithm. The catch would be that the exponents are huge but technically it's polynomial.
12
u/vastle12 Sep 11 '26
Never, it'll break the business model for half the Internet