( en | de | ru )

 

Disambiguation of "Romashchenko, Andrei E."

Author of the publication

copydeleteadd this publication to your clipboard
The axiomatic power of Kolmogorov complexity.

, , , , and . Ann. Pure Appl. Log., 165 (9): 1380-1402 (2014)

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.

Andrei E Dymerets

Andrei Verbovsky

Andrei Munk

Andrei Belitski

Andrei Lehmann

 

Other publications of authors with the same name

Combinatorial Interpretation of Kolmogorov Complexity., , and . CCC, page 131-137. IEEE Computer Society, (2000)Variations on Muchnik's Conditional Complexity Theorem., , and . Theory Comput. Syst., 49 (2): 227-245 (2011)A Criterion for Extractability of Mutual Information for a Triple of Strings.. Probl. Inf. Transm., 39 (1): 148-157 (2003)A Random Oracle Does Not Help Extract the Mutual Information., and . MFCS, volume 5162 of Lecture Notes in Computer Science, page 527-538. Springer, (2008)On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables., , , and . STACS, volume 66 of LIPIcs, page 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma., and . ISIT, page 1377-1381. IEEE, (2019)Resource-bounded Kolmogorov complexity provides an obstacle to soficness of multidimensional shifts., and . J. Comput. Syst. Sci., (2022)Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error.. CSR, volume 6651 of Lecture Notes in Computer Science, page 50-63. Springer, (2011)Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem., and . MFCS (2), volume 9235 of Lecture Notes in Computer Science, page 235-247. Springer, (2015)Clustering with respect to the information distance.. Theor. Comput. Sci., (2022)