Inferring a tree from walks (Q1351963): Difference between revisions

@@ Property / cites work @@
+On the complexity of minimum inference of regular sets
+Normal rank
@@ Property / cites work @@
+Q4230322
@@ Property / cites work: Q4230322 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear approximation of shortest superstrings
@@ Property / cites work: Linear approximation of shortest superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+On finding minimal length superstrings
@@ Property / cites work: On finding minimal length superstrings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of automaton identification from given data
+Normal rank
@@ Property / cites work @@
+A note on shortest superstrings with flipping
@@ Property / cites work: A note on shortest superstrings with flipping / rank @@
+Normal rank
@@ Property / cites work @@
+Graph inference from a walk for trees of bounded degree 3 is NP-complete
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q3221403
@@ Property / cites work: Q3221403 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum consistent DFA problem cannot be approximated within any polynomial
+Normal rank
@@ Property / cites work @@
+Bounded degree graph inference from walks
@@ Property / cites work: Bounded degree graph inference from walks / rank @@
+Normal rank