10 citations · 10 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization
Daniel Gibney, Ce Jin, Tomasz Kociumaka +1
Classically, the edit distance of two length- strings can be computed in time, whereas an -time procedure would falsify the Orthogonal Vectors Hypothesis. I…
cs.DS2023★ 10 cited
Approximating Knapsack and Partition via Dense Subset Sums
Mingyang Deng, Ce Jin, Xiao Mao
Knapsack and Partition are two important additive problems whose fine-grained complexities in the -approximation setting are not yet settled. In this work, we make…