Kolmogorov seminar on computational complexity and descriptive complexity (Moscow)
|
Kolmogorov seminar on computational complexity and descriptive complexity, Moscow |
|
|
May 5, 2014 (Mon) |
 |
1. |
Предзащита дипломных работ студентов кафедры математической логики Alexander Lebedkin, Alexander Melnikov May 5, 2014 16:45, Moscow
|
|
|
|
|
|
March 31, 2014 (Mon) |
 |
2. |
Choice paradoxes in social network games M. A. Raskin March 31, 2014 15:45, Moscow
|
|
|
|
|
|
March 17, 2014 (Mon) |
 |
3. |
Информационная и коммуникационная сложность: общий и приватные источники случайности N. K. Vereshchagin, A. Kozachinsky March 17, 2014 16:45, Moscow
|
|
|
|
|
|
December 16, 2013 (Mon) |
 |
4. |
Communication complexity of approximation of Kolmogorov complexity N. K. Vereshchagin December 16, 2013 16:45, Moscow
|
|
|
|
|
|
December 9, 2013 (Mon) |
 |
5. |
Linear lower bound for randomized communication complexity of disjointness (the proof by Braverman) A. Kozachinsky December 9, 2013 16:45, Moscow
|
|
|
|
|
|
December 2, 2013 (Mon) |
 |
6. |
Deep effectively closed sets L. Bienvenu December 2, 2013 16:45, Moscow
|
|
|
|
|
|
November 25, 2013 (Mon) |
 |
7. |
Informational independence: towards the definition of information for infinite objects and related structures V. V. V'yugin November 25, 2013 16:45, Moscow
|
|
|
|
|
|
November 18, 2013 (Mon) |
 |
8. |
Informational independence: towards the definition of information for infinite objects and related structures V. V. V'yugin November 18, 2013 16:45, Moscow
|
|
|
|
|
|
October 14, 2013 (Mon) |
 |
9. |
Deep effectively closed sets L. Bienvenu October 14, 2013 16:45, Moscow
|
|
|
|
|
|
May 13, 2013 (Mon) |
 |
10. |
Presentations of graduate papers Ishkina Shaura, Vasilevskaya Mariya, Savin A. A., Statsekno M. M., Zhitinnikov P. A. May 13, 2013 16:45, Moscow
|
|
|
|
|
|
May 6, 2013 (Mon) |
 |
11. |
On representation of contours of letters Poburinnaya Oksana May 6, 2013 16:45, Moscow
|
|
|
|
|
|
April 29, 2013 (Mon) |
 |
12. |
Множества малой слабой lambda-меры и большей сильной $\lambda$-меры Kumok Akim April 29, 2013 16:45, Moscow
|
|
|
|
|
|
April 22, 2013 (Mon) |
 |
13. |
Complexity of garden hoses Dektyarev Michail April 22, 2013 16:45, Moscow
|
|
|
|
|
|
April 15, 2013 (Mon) |
 |
14. |
Effective alpha-zero sets Andreev Michail April 15, 2013 16:45, Moscow
|
|
|
|
|
|
April 8, 2013 (Mon) |
 |
15. |
Communicative information N. K. Vereshchagin April 8, 2013 16:45, Moscow
|
|
|
|
|
|
April 1, 2013 (Mon) |
 |
16. |
Threshold gates on the set $\{1,2\}$ and threshold circuits V. V. Podolskii April 1, 2013 16:45, Moscow
|
|
|
|
|
|
March 25, 2013 (Mon) |
 |
17. |
Finitely related nilsemigroups and aperiodic tilings I. A. Ivanov-Pogodaev March 25, 2013 16:45, Moscow
|
|
|
|
|
|
March 18, 2013 (Mon) |
 |
18. |
Algorithmic statistics A. Kh. Shen' March 18, 2013 16:45, Moscow
|
|
|
|
|
|
March 11, 2013 (Mon) |
 |
19. |
Дистанционные графы и приложение к одной задаче рамсеевского типа A. B. Kupavskii March 11, 2013 16:45, Moscow
|
|
|
|
|
|
March 4, 2013 (Mon) |
 |
20. |
Algorithmic decidability of periodicity of morphic sequences I. V. Mitrofanov March 4, 2013 16:45, Moscow
|
|
|
|
|
|
February 25, 2013 (Mon) |
 |
21. |
On rhombus tilings T. Fernique February 25, 2013 16:45, Moscow
|
|
|
|
|
|
December 17, 2012 (Mon) |
 |
22. |
Short lists with short programs in short time N. K. Vereshchagin December 17, 2012 16:45, Moscow
|
|
|
|
|
|
December 10, 2012 (Mon) |
 |
23. |
Universal conditional coding in space-bounded framework D. V. Musatov December 10, 2012 16:45, Moscow
|
|
|
|
|
|
November 26, 2012 (Mon) |
 |
24. |
A Recent NP-Hardness Result for Approximation of 3-Coloring Aaron Schild November 26, 2012 16:45, Moscow
|
|
|
|
|
|
November 19, 2012 (Mon) |
 |
25. |
On a new construction of pseudo-random generators Makhlin Anton November 19, 2012 16:45, Moscow
|
|
|
|
|
|
October 29, 2012 (Mon) |
 |
26. |
Group representations and locally decodable codes N. K. Vereshchagin October 29, 2012 16:45, Moscow
|
|
|
|
|
|
July 9, 2012 (Mon) |
 |
27. |
Dispelling an old myth about an ancient algorithm Vijay Vazirani July 9, 2012 15:00, Moscow, Bolshoy Vlasyevskiy Pereulok 11
|
|
|
|
|
|
May 21, 2012 (Mon) |
 |
28. |
Exact and approximate algorithm for the traveling salesman problem Golovnev Alexander May 21, 2012 13:00, Moscow
|
|
|
|
|
|
May 5, 2012 (Sat) |
 |
29. |
Steganography M. Statsenko May 5, 2012 16:45, Moscow
|
|
|
|
|
|
April 28, 2012 (Sat) |
 |
30. |
What we can compute given random strings as an oracle N. K. Vereshchagin April 28, 2012 16:45, Moscow
|
|
|
|
|
|
April 23, 2012 (Mon) |
 |
31. |
The notion of zero knowledge N. K. Vereshchagin April 23, 2012 16:45, Moscow
|
|
|
|
|
|
April 16, 2012 (Mon) |
 |
32. |
Computational complexity on financial markets, or expanders vs against the global crisis Musatov Daniil April 16, 2012 16:45, Moscow
|
|
|
|
|
|
April 9, 2012 (Mon) |
 |
33. |
On Some Methods for Text and Pattern Recognition I. V. Mezhirov April 9, 2012 16:45, Moscow
|
|
|
|
|
|
April 2, 2012 (Mon) |
 |
34. |
Algebras of minimal multiplicative complexity B. V. Chokaev April 2, 2012 16:45, Moscow
|
|
|
|
|
|
March 26, 2012 (Mon) |
 |
35. |
Coverings of all long shortest paths and their applications I. P. Razenshteyn March 26, 2012 16:45, Moscow
|
|
|
|
|
|
March 12, 2012 (Mon) |
 |
36. |
Continuations as first-class values and their application in programming M. A. Raskin March 12, 2012 16:45, Moscow
|
|
|
|
 |
|