Because searching over the space of all possible translations is NP-hard (Knight 1999), SMT decoders use heuristic search algorithms to only explore a promising subset of the search space.
limiting the set of explorable input permutations is an essential way to reduce decoding complexity.