Computing Minimum Length Representations of Sets of Words of Uniform Length (Q2946043): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Representability of Sets of Words of Equal Length in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Deciding representability of sets of words of equal length
+Normal rank
@@ Property / cites work @@
+Mellin transforms and asymptotics: Digital sums
@@ Property / cites work: Mellin transforms and asymptotics: Digital sums / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Minimum-Cost Circulations by Successive Approximation
+Normal rank
@@ Property / cites work @@
+Number of Odd Binomial Coefficients
@@ Property / cites work: Number of Odd Binomial Coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+Q5310362
@@ Property / cites work: Q5310362 / rank @@
+Normal rank
@@ Property / cites work @@
+On Pseudo-Random Arrays
@@ Property / cites work: On Pseudo-Random Arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Sets Represented as the Length-n Factors of a Word
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank