Common Permutation Problem
Computational Complexity
2008-04-01 v1
Abstract
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 a subsequence of both of the given strings.
Keywords
Cite
@article{arxiv.0803.4261,
title = {Common Permutation Problem},
author = {Marián Dvorský},
journal= {arXiv preprint arXiv:0803.4261},
year = {2008}
}