The Smallest Grammar Problem Revisited
The Smallest Grammar Problem Revisited
复制标题
重温最小的语法问题
DOI:
10.1109/tit.2020.3038147
复制
发表时间:
2020
影响因子:
2.5
通讯作者:
Carl Philipp Reh
中科院分区:
文献类型:
--
作者:
Hideo Bannai;Momoko Hirayama;Danny Hucke;Shunsuke Inenaga;Artur Jeż;Markus Lohrey;Carl Philipp Reh
In a seminal paper, Charikar et al. derive upper and lower bounds on the approximation ratios for several grammar-based compressors, but in all cases there is a gap between the lower and upper bound. Here the gaps for LZ78 and BISECTION are closed by showing that the approximation ratio of LZ78 is Θ((n/log n)2/3), whereas the approximation ratio of BISECTION is Θ(√(n/log n)). In addition, the lower bound for RePair is improved from Ω(√(log n)) to Ω(log n/log log n). Finally, results of Arpe and Reischuk relating grammar-based compression for arbitrary alphabets and binary alphabets are improved.
登录
查看更多内容
DOI:
--
发表时间:
1976
期刊:
CACM
影响因子:
--
作者:
F. Rubin
通讯作者:
F. Rubin
DOI:
10.4230/lipics.cpm.2019.11
发表时间:
2019
期刊:
ACM Computing Surveys (CSUR)
影响因子:
--
作者:
Michal Ganczorz
通讯作者:
Michal Ganczorz
影响因子:
7.015
作者:
Katrin Casel;H. Fernau;Serge Gaspers;Benjamin Gras;Markus L. Schmid
通讯作者:
Markus L. Schmid
影响因子:
3.7
作者:
Lohrey, Markus;Maneth, Sebastian;Mennicke, Roy
通讯作者:
Mennicke, Roy
DOI:
--
发表时间:
2011
期刊:
arXiv.org
影响因子:
--
作者:
J. Kieffer;P. Flajolet;E. Yang
通讯作者:
E. Yang