2 ms·
Something being NP-hard doesn't preclude algorithms that solve or sufficiently approximate solutions for instances that occur in practice. SAT is also NP-hard,
by adrianN 9y ago
Something being NP-hard doesn't preclude algorithms that solve or sufficiently approximate solutions for instances that occur in practice. SAT is also NP-hard, but you can download solvers that can handle most huge instances you need solved just fine.
- Sniffnoy 9y agoWhich is the sort of thing the article ought to talk about!