it's only NP hard if you want it to be perfect. "good enough" is not NP hard I don't recall what we implement but it's probably a decent approximation
-
-
-
IIRC, the proof of NP-hardness is for the satisfaction version, i.e. finding any solution. Still, I truly believe it is not a problem in practice; heuristics solves all naturally occurring instances.
- 6 more replies
New conversation -
-
-
Totally agree. It feels like Go creators stance on it being a huge issue was just an excuse to let the greybeards NIH something again.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
If you have anywhere near the number of dependencies where big-O matters at all, then statistically you have so hopelessly many low-quality, unfixably-bad components that you just need to throw everything away and start over.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
removing lock files seems like a win.
-
Removing lockfiles removes a useful feature (auto upgrade) for no good reason.
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.