11 - 20 out of 101Page size: 10
  1. 2022

  2. A Q-WADGE HIERARCHY IN QUASI-POLISH SPACES

    Selivanov, V., 5 Jun 2022, In: Journal of Symbolic Logic. 87, 2, p. 732-757 26 p.

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

  3. Boole vs Wadge: Comparing Two Basic Tools of Descriptive Set Theory

    Selivanov, V., 1 Jan 2022, Revolutions and Revelations in Computability. p. 287-298 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13359).

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

  4. Enumerating Classes of Effective Quasi-Polish Spaces

    de Brecht, M., Kihara, T. & Selivanov, V., 1 Jan 2022, Revolutions and Revelations in Computability. Springer Nature, p. 88-102 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13359).

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

  5. Fields of Algebraic Numbers Computable in Polynomial Time. II

    Alaev, P. E. & Selivanov, V. L., 1 Jan 2022, In: Algebra and Logic. 60, 6, p. 349-359 11 p.

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

  6. 2021

  7. Precomplete Numberings

    Selivanov, V. L., 1 Jul 2021, In: Journal of Mathematical Sciences (United States). 256, 1, p. 96-124 29 p.

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

  8. Input-Driven Pushdown Automata on Well-Nested Infinite Strings

    Okhotin, A. & Selivanov, V. L., Jun 2021, Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings. Santhanam, R. & Musatov, D. (eds.). Springer Nature, p. 349-360 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12730 LNCS).

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

  9. Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

    Selivanova, S. & Selivanov, V., 1 Jan 2021, In: Computability. 10, 2, p. 123-140 18 p.

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

  10. Complexity Issues for the Iterated h-Preorders

    Alaev, P. & Selivanov, V., 1 Jan 2021, Descriptional Complexity of Formal Systems. p. 1-12 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13037).

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

  11. Non-collapse of the Effective Wadge Hierarchy

    Selivanov, V., 1 Jan 2021, Connecting with Computability. p. 407-416 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12813).

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

  12. Searching for Applicable Versions of Computable Structures

    Alaev, P. E. & Selivanov, V. L., 1 Jan 2021, Connecting with Computability. p. 1-11 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12813).

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

Previous 1 2 3 4 5 6 7 8 ...11 Next

ID: 42363115