1. 2021
  2. 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 journalArticlepeer-review

  3. 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 proceedingConference contributionpeer-review

  4. 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 proceedingConference contributionpeer-review

  5. 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 proceedingConference contributionpeer-review

  6. 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 proceedingConference contributionpeer-review

  7. 2020
  8. 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 journalArticlepeer-review

  9. 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 proceedingConference contributionpeer-review

  10. 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 proceedingConference contributionpeer-review

  11. 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 journalArticlepeer-review

  12. 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 journalArticlepeer-review

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

ID: 42363115