Open AccessDeciding the finiteness of simple permutations contained in a wreath-closed class is polynomial
Author(s) -
Frédérique Bassino,
Mathilde Bouvel,
Adeline Pierrot,
Dominique Rossin
Publication year - 2009
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - simple (philosophy) , class (philosophy) , mathematics , combinatorics , wreath product , polynomial , discrete mathematics , computer science , artificial intelligence , geometry , epistemology , product (mathematics) , mathematical analysis , philosophy