11 - 15 out of 15Page size: 10
  1. 2020

  2. The expressiveness of looping terms in the semantic programming

    Goncharov, S., Ospichev, S., Ponomaryov, D. & Sviridenko, D., 2020, In: Сибирские электронные математические известия. 17, p. 380-394 15 p., 024.

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

  3. On termination of transactions over semantic document models

    Mantsivoda, A. V. & Ponomaryov, D. K., 1 Jan 2020, In: Bulletin of Irkutsk State University, Series Mathematics. 31, p. 111-131 21 p.

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

  4. The complexity of AND—decomposition of Boolean functions

    Emelyanov, P. & Ponomaryov, D., 15 Jun 2020, In: Discrete Applied Mathematics. 280, p. 113-132 20 p.

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

  5. 2021

  6. Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation

    Emelyanov, P. G., Krishna, M., Kulkarni, V., Nandy, S. K., Ponomaryov, D. K. & Raha, S., Mar 2021, In: Programming and Computer Software. 47, 2, p. 108-118 11 p.

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

  7. On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

    Ponomaryov, D., Dec 2021, In: Lobachevskii Journal of Mathematics. 42, 12, p. 2905-2912 8 p., 24.

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

Previous 1 2 Next

ID: 3449889