On the Complexity and Approximability of Bounded Access Lempel Ziv Coding
- 27 July 2024
- book chapter
- Published by Springer Nature
- p. 114-130
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- On the Number of Factors in the LZ-End Factorization2023
- On the Approximation Ratio of LZ-End to LZ772021
- Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings2013
- LZ77-Like Compression with Fast Random Access2010
- Complexity of approximating bounded variants of optimization problemsTheoretical Computer Science, 2005
- A short guide to approximation preserving reductions2002
- Hardness of approximating problems on cubic graphs1997
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976
- 2726. A problem on strings of beadsThe Mathematical Gazette, 1957