2 citations · 2 across the 1 of their papers we have counts for
1 paper
Marián Dvorský
In this paper we show that the following problem is NP-complete: Given an alphabet Σ and two strings over Σ, the question is whether there exists a permutation of Σ which is…