New bounds for the language compression problem

2000

Presented at the Annual IEEE Conference on Computational Complexity, Florence

Additional Metadata
MSC	Algorithmic information theory (Kolmogorov complexity, etc.) (msc 68Q30)
Publisher	IEEE Computer Soc. (Los Alamitos, CA)
Conference	Annual IEEE Conference on Computational Complexity
Organisation	Quantum Computing and Advanced System Research
Citation APA APA Style APA-ALL Style AAA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Buhrman, H., Laplante, S.& Miltersen, P. B. (2000). New bounds for the language compression problem. Proceedings of Annual IEEE Conference on Computational Complexity 2000 (15), 126–130.

Publication