Pages that link to "Item:Q2461214"
From MaRDI portal
The following pages link to Short proofs for cut-and-paste sorting of permutations (Q2461214):
Displayed 7 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- Sorting by shuffling methods and a queue (Q2161211) (← links)
- A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations (Q3511344) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)