The following pages link to (Q2722006):
Displaying 5 items.
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- On the least exponential growth admitting uncountably many closed permutation classes (Q1885903) (← links)
- Simple permutations: Decidability and unavoidable substructures (Q2474234) (← links)
- Solving a permutation problem by a fully polynomial-time approximation scheme (Q3000079) (← links)
- (Q5089220) (← links)