Unranking permutations in transposition order and linear time

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

An algorithm is presented for unranking permutations in transposition order:
Given a seed s\in N, the algorithm produces a permutation P(s) that differs
from the permutation P(s+1) by the transposition of two elements.

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

Unranking permutations in transposition order and linear time 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 Unranking permutations in transposition order and linear time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Unranking permutations in transposition order and linear time will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-400390

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