arXiv (All)
open access
Fine-Grained Hardness of Approximating Dynamic Time Warping
We prove conditional lower bounds for approximating dynamic time warping (DTW) over the uniform metric on three symbols. Let $N, M$ be the two string lengths and $n, m$ their respective numbers of runs. Under the Gap Block Disjointness (GBD) hypothesis, for every fixed $κ\in (0,1/6)$ and $δ\in (0,1)
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast Gradient-Based Approximation of Continuous Dynamic Time Warping#1297481
- Dynamic Time Warping in the Low-Distance Regime#1154511
- Instruction Set Extensions for Dynamic Time Warping#612103
- An interpolated periodogram-based metric for comparison of time series with unequal lengths#1274809
- VideoFlexTok: Flexible-Length Coarse-to-Fine Video Tokenization#13089
Record · ID 1233272
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive