News for hackers. Stuff that matters.
Re:Modern SAT solvers: fast, neat and underused by nhaehnle on Saturday August 04, 2018 @11:55AM (#17687313)
There's no general answer to your question, it depends on the problems. You can find parameter-preserving reductions between some problems, but this isn't always the case.

Also, instead of looking at fixed parameter tractability, it often makes more sense to look at approximation algorithms (if your goal is to optimize something, rather than getting a strict Yes/No answer).

There are no comments on this comment yet.