4 ms·
"de Bruijin sequence is a similar problem, but this problem has the additional constraint of being non-cyclical." [1] [1] http://mathsci.wikia.com/wiki/Talk:Th
by latchkey 8y ago
"de Bruijin sequence is a similar problem, but this problem has the additional constraint of being non-cyclical." [1]
[1] http://mathsci.wikia.com/wiki/Talk:The_Haruhi_Problem/@comment-36964662-20181024143823/@comment-101.164.81.64-20181024145520?permalink=2075#comm-2075 http://mathsci.wikia.com/wiki/Talk:The_Haruhi_Problem/@comme...
- krackers 8y agoAdditionally de bruijin sequences are about generating all possible n-length strings from a fixed k-character set (where you can repeat characters). In this problem we only want to generate k-length permutations of a k-character set.