3 ms·
NP-hard problems are not always unfeasible. There are pretty good 3-sat solvers out of the box depending on your problem size. That being said, I don't know th
by pyrale 8y ago
NP-hard problems are not always unfeasible. There are pretty good 3-sat solvers out of the box depending on your problem size.
That being said, I don't know the details of your situation