Sublinear Algorithms for Approximating String Compressibility
From MaRDI portal
Publication:3603498
DOI10.1007/978-3-540-74208-1_44zbMath1171.68474OpenAlexW2104467883MaRDI QIDQ3603498
No author found.
Publication date: 17 February 2009
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/73520
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Sublinear Algorithms for Approximating String Compressibility
