7 ms·
indeed: you're typically not interested in the optimum, but only in something that's good enough.
by toolslive 5y ago
indeed: you're typically not interested in the optimum, but only in something that's good enough.
- hansvm 5y agoWhich is often still expensive (not the case here) -- iirc even approximating a Bayesian network is NP-complete.
- whatshisface 5y agoAn interesting subtle distinction is the one between problems that stay in the same complexity class as you loosen the approximation requirements and problems that drop to lower ones.