Near-Optimal Quantum Algorithms for String Problems | 0 | 0.34 | 2022 |
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. | 0 | 0.34 | 2022 |
Improved Approximation for Longest Common Subsequence over Small Alphabets | 0 | 0.34 | 2021 |
Faster Algorithms for Bounded Tree Edit Distance | 0 | 0.34 | 2021 |