Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv 
Factorization

Gibney, Daniel; Jin, Ce; Kociumaka, Tomasz; Thankachan, Sharma V.

doi:10.1137/1.9781611977912.118

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

MPS-Authors

/persons/resource/persons284929

Kociumaka, Tomasz
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://epubs.siam.org/doi/10.1137/1.9781611977912.118
(Publisher version)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gibney, D., Jin, C., Kociumaka, T., & Thankachan, S. V. (2024). Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization. In D. P. Woodruff (Ed.), Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 3302-3332). Philadelphia, PA: SIAM. doi:10.1137/1.9781611977912.118.

Cite as: https://hdl.handle.net/21.11116/0000-0010-33E3-4

Abstract

There is no abstract available