Login / Signup
Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial
Frédérique Bassino
Mathilde Bouvel
Adeline Pierrot
Dominique Rossin
Published in:
CoRR (2010)
Keyphrases
</>
small number
information retrieval
computational complexity
expert systems
upper bound
multi class
memory requirements
fixed number
multiple classes
positive integer
databases
real world
data structure
maximum number
efficient learning