3 ms·
is that anything close to like polynomial fitting? What with PTIME and NP-Completion?
by posterboy 9y ago
is that anything close to like polynomial fitting? What with PTIME and NP-Completion?
- mholt 9y agoKind of - but instead of computational complexity in the "NP" sense, you have lots of data. It's often so hard to get good training data that the cost of just waiting out a big algorithm to finish can be cheaper. So you have to weigh that.
- posterboy 9y agowell sure, you said as much before. But I was also thinking, what if P~=NP, in the sense that any function can be approximated by a polynomial of sufficiently high degree.