Non-reducible descriptions for conditional Kolmogorov complexity - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Andrei A. Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin. Non-reducible descriptions for conditional Kolmogorov complexity. Electronic Colloquium on Computational Complexity (ECCC), (054), 2004. [doi]

The following publications are possibly variants of this publication:

Non-reducible Descriptions for Conditional Kolmogorov ComplexityAndrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin, Michael V. Vyugin. tamc 2006: 308-317 [doi]

Non-reducible descriptions for conditional Kolmogorov complexityAndrej Muchnik, Alexander Shen, Mikhail Ustinov, Nikolai K. Vereshchagin, Michael V. Vyugin. TCS, 384(1):77-86, 2007. [doi]

Multi-conditional Descriptions and Codes in Kolmogorov ComplexityAndrei A. Muchnik, Alexei L. Semenov. eccc, 7(15), 2000. [doi]

Kolmogorov complexity conditional to large integersNikolai K. Vereshchagin. TCS, 271(1-2):59-67, 2002. [doi]

Kolmogorov Complexity Conditional to Large IntegersNikolai K. Vereshchagin. eccc, (086), 2001. [doi]

Non-linear Inequalities between Predictive and Kolmogorov ComplexitiesMichael V. Vyugin, Vladimir V. V yugin. alt 2001: 190-204 [doi]

Non-linear Inequalities between Predictive and Kolmogorov ComplexityMichael V. Vyugin, Vladimir V. V yugin. eccc, 8(52), 2001. [doi]

runs on WebDSL