( en | de | ru )

 

Disambiguation of "Vyugin, Michael V."

Author of the publication

copydeleteadd this publication to your clipboard
Non-reducible Descriptions for Conditional Kolmogorov Complexity.

, , , and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 308-317. Springer, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

V Saile

V Geoffroy

V Ustinov

V Adams

V Fendrich

 

Other publications of authors with the same name

Non-reducible Descriptions for Conditional Kolmogorov Complexity., , , and . TAMC, volume 3959 of Lecture Notes in Computer Science, page 308-317. Springer, (2006)Non-reducible descriptions for conditional Kolmogorov complexity., , , , and . Theor. Comput. Sci., 384 (1): 77-86 (2007)The weak aggregating algorithm and weak mixability., and . J. Comput. Syst. Sci., 74 (8): 1228-1244 (2008)How Many Strings Are Easy to Predict?, , and . COLT, volume 2777 of Lecture Notes in Computer Science, page 522-536. Springer, (2003)Independent minimum length programs to translate between given strings., and . Theor. Comput. Sci., 271 (1-2): 131-143 (2002)How many strings are easy to predict?, , and . Inf. Comput., 201 (1): 55-71 (2005)The Weak Aggregating Algorithm and Weak Mixability., and . COLT, volume 3559 of Lecture Notes in Computer Science, page 188-203. Springer, (2005)Non-linear Inequalities between Predictive and Kolmogorov Complexity, and . Electron. Colloquium Comput. Complex., (2001)Predictive complexity and information, and . Electron. Colloquium Comput. Complex., (2001)Systems of Strings with High Mutual Complexity.. Probl. Inf. Transm., 39 (4): 395-399 (2003)