Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

Marius Zimand

Home/Archive/arXiv

arXiv · 0902.2141

Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence

Marius Zimand

View original source ↗Read source document ↗Export metadata ↓

Abstract

An infinite binary sequence has randomness rate at least $σ$ if, for almost every $n$, the Kolmogorov complexity of its prefix of length $n$ is at least $σn$. It is known that for every rational $σ\in (0,1)$, on one hand, there exists sequences with randomness rate $σ$ that can not be effectively transformed into a sequence with randomness rate higher than $σ$ and, on the other hand, any two independent sequences with randomness rate $σ$ can be transformed into a sequence with randomness rate higher than $σ$. We show that the latter result holds even if the two input sequences have linear dependency (which, informally speaking, means that all prefixes of length $n$ of the two sequences have in common a constant fraction of their information). The similar problem is studied for finite strings. It is shown that from any two strings with sufficiently large Kolmogorov complexity and sufficiently small dependence, one can effectively construct a string that is random even conditioned by any one of the input strings.

Explore related subjects

cs.CC cs.IT math.IT

Keep this discovery

BibTeX RIS

Marius Zimand. 2009-02-12. Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. https://arxiv.org/abs/0902.2141

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗