In the worst case, our runtime may be exponential in the number of constraints, since we are considering an intractable class of problems.
we show that in practice, the method is quite effective at rapid decoding under global hard constraints.