21 - 30 out of 101Page size: 10
  1. 2021

  2. Primitive Recursive Ordered Fields and Some Applications

    Selivanov, V. & Selivanova, S., 2021, Proceedings of Computer Algebra in Scientific Computing (CASC 2021). . Springer Nature, p. 353-369 17 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12865).

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

  3. 2020

  4. On Degree Spectra of Topological Spaces

    Selivanov, V. L., 1 Feb 2020, In: Lobachevskii Journal of Mathematics. 41, 2, p. 252-259 8 p.

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

  5. Classifying -Regular Aperiodic k-Partitions

    Selivanov, V., 1 Jan 2020, Descriptional Complexity of Formal Systems. p. 193-205 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12442).

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

  6. Degrees of Non-computability of Homeomorphism Types of Polish Spaces

    Hoyrup, M., Kihara, T. & Selivanov, V., 1 Jan 2020, Beyond the Horizon of Computability. p. 189-192 4 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12098).

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

  7. Fields of Algebraic Numbers Computable in Polynomial Time. I

    Alaev, P. E. & Selivanov, V. L., 1 Jan 2020, In: Algebra and Logic. 58, 6, p. 447-469 23 p.

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

  8. Q-Wadge degrees as free structures

    Selivanov, V., 1 Jan 2020, In: Computability. 9, 3-4, p. 327-341 15 p.

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

  9. Well-Quasi Orders and Hierarchy Theory

    Selivanov, V., 1 Jan 2020, Well-Quasi Orders in Computation, Logic, Language and Reasoning. Vol. 53. p. 271-319 49 p. (Trends in Logic; vol. 53).

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

  10. 2019

  11. Computability on Quasi-Polish Spaces

    Hoyrup, M., Rojas, C., Selivanov, V. & Stull, D. M., 1 Jan 2019, Descriptional Complexity of Formal Systems. p. 171-183 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612).

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

  12. On Classes of Regular Languages Related to Monotone WQOs

    Ogawa, M. & Selivanov, V., 1 Jan 2019, Descriptional Complexity of Formal Systems. p. 235-247 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612).

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

  13. 2018

  14. Polynomial Computability of Fields of Algebraic Numbers

    Alaev, P. E. & Selivanov, V. L., 1 Jul 2018, In: Doklady Mathematics. 98, 1, p. 341-343 3 p.

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

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

ID: 42363115