Pages that link to "Item:Q4571928"
From MaRDI portal
The following pages link to Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928):
Displaying 13 items.
- The intractability of computing the Hamming distance (Q557834) (← links)
- A lower bound for the edit-distance problem under an arbitrary cost function (Q1107330) (← links)
- Dynamic and internal longest common substring (Q2211363) (← links)
- Longest common subsequence in sublinear space (Q2656347) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- (Q5092429) (← links)
- On the hardness of approximate and exact (bichromatic) maximum inner product (Q5140838) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- (Q5875468) (← links)
- Absent Subsequences in Words (Q6070611) (← links)
- Matching patterns with variables under edit distance (Q6111591) (← links)
- Near-optimal quantum algorithms for string problems (Q6174814) (← links)
