The following pages link to Subtree Isomorphism Revisited (Q4554355):
Displaying 4 items.
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
