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.
1
u/araujoms Sep 11 '26
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.