Login
From:
Bosker Blog
(Uncensored)
subscribe
Superpermutations: lower bound | Bosker Blog
https://bosker.wordpress.com/2018/10/20/superpermutations-lower-bound/
links
backlinks
Tagged with:
chatter
I wrote about superpermutations here: a superpermutation is a string that has as substrings all the permutations of some set of symbols. For example, there are six permutations of the symbols 1, 2,…
Roast topics
Find topics
Roast it!
Roast topics
Find topics
Find it!
Roast topics
Find topics
Find it!
