3 ms·
And quite possibly NP-complete.
by tempodox 6y ago
And quite possibly NP-complete.
- GuB-42 6y agoMore like NP-hard. I don't think that something like a SAT solver will help you much with your estimations. But you can probably turn a NP-complete problem in terms of software project estimation. The traveling salesman problem looks like a good candidate here. Edit: come to think of it, it is like the halting problem, your project may never finish
- kansface 6y ago> Edit: come to think of it, it is like the halting problem, your project may never finish Uncertainty in the solution can only be reduced to the extent you have actually solved the problem. Of course, the problem may may not be solvable or alternatively, the cost can be too high.