1 - 7 out of 7Page size: 10
  1. 2020

  2. Polynomially Computable Structures with Finitely Many Generators

    Alaev, P. E., Jul 2020, In: Algebra and Logic. 59, 3, p. 266-272 7 p.

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

  3. 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

  4. 2018

  5. Categoricity for Primitive Recursive and Polynomial Boolean Algebras

    Alaev, P. E., 1 Sept 2018, In: Algebra and Logic. 57, 4, p. 251-274 24 p.

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

  6. 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

  7. Polynomial-time presentations of algebraic number fields

    Alaev, P. & Selivanov, V., 1 Jan 2018, Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Proceedings. Manea, F., Miller, RG. & Nowotka, D. (eds.). Springer-Verlag GmbH and Co. KG, p. 20-29 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10936 LNCS).

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

  8. Structures Computable in Polynomial Time. II

    Alaev, P. E., 1 Jan 2018, In: Algebra and Logic. 56, 6, p. 429-442 14 p.

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

  9. 2017

  10. Structures Computable in Polynomial Time. I

    Alaev, P. E., 1 Jan 2017, In: Algebra and Logic. 55, 6, p. 421-435 15 p.

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

ID: 3437321