Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings

Documents similaires

• An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
  par: Li, Rao
  Publié: (2024)
• Faster Algorithms for Longest Common Substring
  par: Charalampopoulos, Panagiotis, et autres
  Publié: (2021)
• Longest Unbordered Factors on Run-Length Encoded Strings
  par: Sekizaki, Shoma, et autres
  Publié: (2025)
• Dynamic Longest Common Substring in Polylogarithmic Time
  par: Charalampopoulos, Panagiotis, et autres
  Publié: (2020)
• Improved Quantum Algorithms for Eigenvalues Finding and Gradient Descent
  par: Nghiem, Nhat A., et autres
  Publié: (2023)