Диссертация (1103424), страница 26
Текст из файла (страница 26)
Zimand, M. Symmetry of Information and Bounds on NonuniformRandomness Extraction via Kolmogorov Extractors / M. Zimand //Proceedings of the 26th IEEE Conference in Computational Complexity. 2011. P. 148156.58. Zimand, M. On the Optimal Compression of Sets in PSPACE /M. Zimand // Proceedings of the 18th International Symposium onFundamentals of Computation Theory. 2011.
P. 6577.127Ðàáîòû àâòîðà ïî òåìå äèññåðòàöèè59. Musatov, D.V. On Extracting Space-Bounded Kolmogorov Complexity/ D.V. Musatov. // Theory of Computing Systems. 2014. DOI10.1007/s00224-014-9563-7.60. Musatov, D.V. Space-Bounded Kolmogorov Extractors / D.V. Musatov// Proceedings of the 7th Computer Science Symposium in Russia.
2012. LNCS, Vol. 7353. P. 266277.61. Musatov, D.V. Improving the Space-Bounded Version of Muchnik'sConditional Complexity Theorem via Naive Derandomization /D.V. Musatov // Theory of Computing Systems. 2014. Vol. 55,no. 2. P. 299312.62. Musatov, D.V. Improving the Space-Bounded Version of Muchnik'sConditional Complexity Theorem via Naive Derandomization /D.V. Musatov // Proceedings of the 6th Computer Science Symposiumin Russia. 2011. LNCS, Vol. 6651.
P. 6476.63. Musatov, D.V. Variations on Muchnik's Conditional ComplexityTheorem / D.V. Musatov, A.E. Romashchenko, A. Shen // Theory ofComputing Systems. 2011. Vol. 49, no. 2. P. 227245.Äèññåðòàíòó ïðèíàäëåæàò äîêàçàòåëüñòâà âñåõ òåîðåì èç ðàçäåëà 3.64.
Musatov, D.V. Variations on Muchnik's Conditional ComplexityTheorem / D.V. Musatov, A.E. Romashchenko, A. Shen // Proceedingsof the 4th Computer Science Symposium in Russia. 2009. LNCS,Vol. 5675. P. 250262.Äèññåðòàíòó ïðèíàäëåæàò äîêàçàòåëüñòâà âñåõ òåîðåì èç ðàçäåëà 3.65. Ìóñàòîâ Ä.Â. Óïðîù¼ííîå äîêàçàòåëüñòâî òåîðåìû Ìó÷íèêà îáóñëîâíîé êîëìîãîðîâñêîé ñëîæíîñòè ñ îãðàíè÷åíèåì íà ïàìÿòü /Ä.Â. Ìóñàòîâ // Òðóäû 55-îé íàó÷íîé êîíôåðåíöèè ÌÔÒÈ. Ì.ÄîëãîïðóäíûéÆóêîâñêèé: ÌÔÒÈ, 2012. Ñ. 3031.128.














