Year: 2008
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Dvorský, Marián
Language: English
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2141446574