Pages that link to "Item:Q4933374"

The following pages link to Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity (Q4933374):

Displayed 14 items.

• Real-valued embeddings and sketches for fast distance and similarity estimation (Q508585) ‎ (← links)
• LCS approximation via embedding into locally non-repetitive strings (Q716327) ‎ (← links)
• Detecting life signatures with RNA sequence similarity measures (Q1717070) ‎ (← links)
• Approximating the geometric edit distance (Q2165024) ‎ (← links)
• Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) ‎ (← links)
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) ‎ (← links)
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False) (Q4571928) ‎ (← links)
• Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) ‎ (← links)
• (Q4638059) ‎ (← links)
• Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds (Q4993300) ‎ (← links)
• Approximating Longest Common Subsequence in Linear Time: Beating the $\sqrt{{n}}$ Barrier (Q5097510) ‎ (← links)
• A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance (Q5240425) ‎ (← links)
• A Linear-Time <i>n</i> ^0.4 -Approximation for Longest Common Subsequence (Q6075744) ‎ (← links)
• (Q6084405) ‎ (← links)