Pages that link to "Item:Q1228615"
From MaRDI portal
The following pages link to A lower bound on the length of a sequence containing all permutations as subsequences (Q1228615):
Displayed 12 items.
- On a conjecture of H. Gupta (Q408183) (← links)
- Preferential arrangement superpatterns (Q510524) (← links)
- Some results on superpatterns for preferential arrangements (Q730640) (← links)
- Shortest prefix strings containing all subset permutations (Q1109773) (← links)
- Lower bounds on the lengths of node sequences in directed graphs (Q1233875) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- Fixing monotone Boolean networks asynchronously (Q2201799) (← links)
- Skip letters for short supersequence of all permutations (Q2675830) (← links)
- A Note on Universal and Canonically Coloured Sequences (Q3552497) (← links)
- Containing All Permutations (Q5144492) (← links)
- Synchronizing Boolean networks asynchronously (Q6098155) (← links)
- An asymptotically tight lower bound for superpatterns with small alphabets (Q6179325) (← links)