Pages that link to "Item:Q526814"

The following pages link to An algorithm computing combinatorial specifications of permutation classes (Q526814):

Displaying 11 items.

• Composability of permutation classes (Q1732039) (← links)
• Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
• A class of recursive permutations which is primitive recursive complete (Q1989331) (← links)
• Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
• An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
• Combinatorial specifications for juxtapositions of permutation classes (Q2327217) (← links)
• Automatic discovery of structural rules of permutation classes (Q4629385) (← links)
• Combinatorial specification of permutation classes (Q5377427) (← links)
• Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers (Q5886342) (← links)
• On the effective and automatic enumeration of polynomial permutation classes (Q5963395) (← links)
• Exact-Size Sampling of Enriched Trees in Linear Time (Q6057780) (← links)