Longest Common Pattern between two Permutations

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper, we give a polynomial (O(n^8)) algorithm for finding a longest
common pattern between two permutations of size n given that one is separable.
We also give an algorithm for general permutations whose complexity depends on
the length of the longest simple permutation involved in one of our
permutations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Longest Common Pattern between two Permutations 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 Longest Common Pattern between two Permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Longest Common Pattern between two Permutations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-368751

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.