On the complexity and approximability of Bounded access Lempel Ziv coding
CoRR(2024)
摘要
We study the complexity of constructing an optimal parsing φ of a
string s = s_1 … s_n under the constraint that given a position p
in the original text, and the LZ76-like (Lempel Ziv 76) encoding of T based
on φ, it is possible to identify/decompress the character s_p by
performing at most c accesses to the LZ encoding, for a given integer c. We
refer to such a parsing φ as a c-bounded access LZ parsing or c-BLZ
parsing of s. We show that for any constant c the problem of
computing the optimal c-BLZ parsing of a string, i.e., the one with the
minimum number of phrases, is NP-hard and also APX hard, i.e., no PTAS can
exist under the standard complexity assumption P ≠ NP. We also study the
ratio between the sizes of an optimal c-BLZ parsing of a string s and
an optimal LZ76 parsing of s (which can be greedily computed in
polynomial time).
更多查看译文
AI 理解论文
溯源树
样例
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要