Nearly optimal language compression using extractors
- Cite this paper as:
- Fortnow L., Laplante S. (1998) Nearly optimal language compression using extractors. In: Morvan M., Meinel C., Krob D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg
- Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser [Sip83] and Buhrman and Fortnow [BF97].
- We use extractors to extract the randomness of strings. In particular we show how to get from an arbitrary string, an incompressible string which encodes almost as much polynomial-time CND complexity as the original string.
TopicsComputational and structural complexity Kolmogorov complexity
Unable to display preview. Download preview PDF.