Pages that link to "Item:Q5390019"
From MaRDI portal
The following pages link to Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence (Q5390019):
Displaying 8 items.
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Algorithmically independent sequences (Q964004) (← links)
- Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences (Q987377) (← links)
- Improving the space-bounded version of Muchnik's conditional complexity theorem via ``naive'' derandomization (Q2254499) (← links)
- On extracting space-bounded Kolmogorov complexity (Q2354592) (← links)
- Generating Kolmogorov random strings from sources with limited independence (Q2844006) (← links)
- On Generating Independent Random Strings (Q3576088) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)