3 ms·
> avoids solving Version-SAT, which is NP-Complete This is just a terrible argument. Sure the problem is NP-Complete to find an optimal solution for the genera
by TheCoelacanth 8y ago
> avoids solving Version-SAT, which is NP-Complete
This is just a terrible argument. Sure the problem is NP-Complete to find an optimal solution for the general case, but you don't need to do that. You need to find a good-enough solution for the cases that people actually use. Heuristics for that problem are plenty fast and even finding the optimal solution is fast enough for most of the problems people are actually trying to use.
- littlestymaar 8y agoYeah, this argument is ridiculous. It's like arguing that people shouldn't have individual homes with garden because lawn mowing is NP-complete… (Not that I'm saying individual homes are a good idea in general, but the NP-complete argument is pretty dumb).
- nicksnyder 8y agoIt isn't an argument, it is just a fact. All else equal, it is a nice fact.
- no_identd 8y agoQuestion #1: Is Version-SAT FPT? (Fixed Parameter Tractable)