The following pages link to Containing All Permutations (Q5144492):
Displaying 12 items.
- Non-uniqueness of minimal superpermutations (Q389216) (← links)
- Shortest prefix strings containing all subset permutations (Q1109773) (← links)
- Shorter strings containing all \(k\)-element permutations (Q1944962) (← links)
- A construction of short sequences containing all permutations of a set as subsequences (Q1953339) (← links)
- Lower bounds for superpatterns and universal sequences (Q2037175) (← links)
- Supertrees (Q2181994) (← links)
- Skip letters for short supersequence of all permutations (Q2675830) (← links)
- Universality of random permutations (Q3300092) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- Critical properties of bipartite permutation graphs (Q6142657) (← links)
- An asymptotically tight lower bound for superpatterns with small alphabets (Q6179325) (← links)
- Constant time and space updates for the sigma-tau problem (Q6545441) (← links)
