Our polynomial-time SAT algorithm does not translate directly into a Viterbi algorithm that is polynomial in the size of the input UG.
we emphasize that for any NP-hard problem with hard constraints, the weighted generalization is also NP-hard.