top | item 19092858 (no title) dons | 7 years ago Solving NP hard problems efficiently. discuss order hn newest amelius|7 years ago I know that every NP problem can be written as an SMT problem, theoretically speaking. But is that actually practical? KirinDave|7 years ago The answer to that question is, "Yes, if your SMT solver has strategies that provide good results for the problem in question."Unless you're implementing solvers or caught up on the particulars of a solver's implementation, the best way to gauge this is to try it.
amelius|7 years ago I know that every NP problem can be written as an SMT problem, theoretically speaking. But is that actually practical? KirinDave|7 years ago The answer to that question is, "Yes, if your SMT solver has strategies that provide good results for the problem in question."Unless you're implementing solvers or caught up on the particulars of a solver's implementation, the best way to gauge this is to try it.
KirinDave|7 years ago The answer to that question is, "Yes, if your SMT solver has strategies that provide good results for the problem in question."Unless you're implementing solvers or caught up on the particulars of a solver's implementation, the best way to gauge this is to try it.
amelius|7 years ago
KirinDave|7 years ago
Unless you're implementing solvers or caught up on the particulars of a solver's implementation, the best way to gauge this is to try it.