The following pages link to (Q4607967):
Displaying 16 items.
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Computing the longest common almost-increasing subsequence (Q2166775) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- The complexity of binary matrix completion under diameter constraints (Q2678254) (← links)
- Absent subsequences in words (Q2695493) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
- Scattered Factor-Universality of Words (Q5041246) (← links)
- (Q5090981) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q5111874) (← links)
- (Q5121902) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Linear-space S-table algorithms for the longest common subsequence problem (Q6104353) (← links)
- Existential Definability over the Subword Ordering (Q6178718) (← links)
- Algorithms and hardness for the longest common subsequence of three strings and related problems (Q6545446) (← links)
