• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Laboratory of Theoretical Computer Science

Publications
Book
Special Issue on Computer Science Symposium in Russia

Edited by: Ф. В. Фомин, V. V. Podolskii.

Vol. 64. Iss. 1. Springer, 2020.

Article
On the Decision Tree Complexity of Threshold Functions

Chistopolskaya A., Podolskii V. V.

Theory of Computing Systems, Springer New York, USA. 2022.

Book chapter
How Much Randomness is Needed to Convert MA Protocols to AM Protocols?

Vereshchagin N.

In bk.: Computer Science – Theory and Applications: 17th International Computer Science Symposium in Russia, CSR 2022, Virtual Event, June 29 – July 1, 2022, Proceedings. Vol. 13296. Springer, 2022. P. 338-349.

Working paper
mGPT: Few-Shot Learners Go Multilingual

Shliazhko O., Fenogenova A., Tikhonova M. et al.

Statistical mechanics. arXie. arXive, 2022

About the Laboratory

The Laboratory  of Theoretical Computer Science  was founded in December 2015. Structurally, it is a part of Big Data and Information Retrieval School at the Faculty of Computer Science.

The main research directions of the laboratory are computational complexity, algorithmic information theory, algorithmic statistics, combinatorial optimization, algorithmic aspects of game theory.