Kolmogorov seminar on computational complexity and descriptive complexity

RUS ENG

Full version

SEMINARS

Kolmogorov seminar on computational complexity and descriptive complexity
Moscow

Website:

https://kolmsem.math.ru

RSS: Forthcoming seminars

Seminar organizers
Vereshchagin Nikolai Konstantinovich
Vyalyi Mikhail Nikolaevich
Semenov Aleksei Lvovich
Romashchenko Andrei Evgenjevich
Shen' Alexander Khanievich

Organizations
Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Kolmogorov seminar on computational complexity and descriptive complexity, Moscow

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