Common Permutation Problem

Details Common Permutation Problem Common Permutation Problem

2008-03-29

arxiv.org/abs/0803.4261v1

Computer Science

Computational Complexity

Scientific paper

In this paper we show that the following problem is NP-complete: Given an
alphabet $\Sigma$ and two strings over $\Sigma$, the question is whether there
exists a permutation of $\Sigma$ which is a subsequence of both of the given
strings.

Affiliated with

Also associated with

No associations

Rating

Common Permutation Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Common Permutation Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Common Permutation Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257478