Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial
Résumé
We present an algorithm running in time O(n log n) which decides if a wreath-closed permutation class Av(B) given by its finite basis B contains a finite number of simple permutations.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|---|
| Licence |
Loading...