1 - 10 out of 43Page size: 10
  1. 2023

  2. Gregory Tseytin: Obituary

    Artemov, S., Беклемишев, Л. Д., Боркин, Л. Я., Вершик, А. М., Гирш, Э. А., Gurevich, Y., Данцин, Е. Я., Ибрагимов, И. А., Kalmens, G., Kreinovich, V., Koubenski, D., Лодкин, А. А., Матиясевич, Ю. В., Новиков, Б. А., Оревков, В. П., Семенов, А., Слисенко, А. О. & Шень, А. Х., Oct 2023, In: Bulletin of the European Association for Theoretical Computer Science. 141, p. 9-14 6 p.

    Research output: Contribution to journal › Article › peer-review

  3. Григорий Самуилович Цейтин (некролог)

    Артемов, С. Н., Беклемишев, Л. Д., Боркин, Л. Я., Вершик, А. М., Гирш, Э. А., Данцин, Е. Я., Ибрагимов, И. А., Кальменс, Е. В., Крейнович, В. Я., Кубенский, Д. А., Лодкин, А. А., Матиясевич, Ю. В., Новиков, Б. А., Оревков, В. П., Семенов, А. Л., Слисенко, А. О. & Шень, А. Х., 31 May 2023, In: УСПЕХИ МАТЕМАТИЧЕСКИХ НАУК. 78, 3(471), p. 170-176 7 p.

    Research output: Contribution to journal › Article › peer-review

  4. 2021

  5. СЛОЖНОСТЬ АЛГЕБРАИЧЕСКИХ ДОКАЗАТЕЛЬСТВ (ОБЗОР)

    Гирш, Э. А., 2021, p. 157. 1 p.

    Research output: Contribution to conference › Paper

  6. 2018

  7. On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Sep 2018, In: Journal of Computer and System Sciences. 96, p. 107-119 13 p.

    Research output: Contribution to journal › Article › peer-review

  8. 2016

  9. A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Find, M. G., Golovnev, A., Hirsch, E. A. & Kulikov, A. S., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. Institute of Electrical and Electronics Engineers Inc., p. 89-98 10 p. 7782921. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  11. 2015

  12. On the probabilistic closure of the loose unambiguous hierarchy

    Hirsch, E. A. & Sokolov, D., 1 Sep 2015, In: Information Processing Letters. 115, 9, p. 725-730 6 p.

    Research output: Contribution to journal › Article › peer-review

  13. 2013

  14. Optimal heuristic algorithms for the image of an injective function

    Hirsch, E. A., Itsykson, D. M., Nikolaenko, V. O. & Smal, A. V., 1 Jan 2013, In: Journal of Mathematical Sciences (United States). 188, 1, p. 7-16 10 p.

    Research output: Contribution to journal › Article › peer-review

  15. 2012

  16. On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography

    Hirsch, E. A., Itsykson, D., Monakhov, I. & Smal, A., 1 Aug 2012, In: Theory of Computing Systems. 51, 2, p. 179-195 17 p.

    Research output: Contribution to journal › Article › peer-review

  17. On an optimal randomized acceptor for graph nonisomorphism

    Hirsch, E. A. & Itsykson, D., 28 Feb 2012, In: Information Processing Letters. 112, 5, p. 166-171 6 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 5 Next

ID: 9072111