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

  2. On a Polytime Factorization Algorithm for Multilinear Polynomials over F2

    Emelyanov, P. & Ponomaryov, D., 1 Jan 2018, Computer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings. Gerdt, VP., Koepf, W., Seiler, WM. & Vorozhtsov, EV. (eds.). Springer, p. 164-176 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11077 LNCS).

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

  3. On the complexity of formulas in semantic programming

    Ospichev, S. & Ponomarev, D., 1 Jan 2018, In: Сибирские электронные математические известия. 15, p. 987-995 9 p.

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

  4. 2017

  5. Cartesian decomposition in data analysis

    Emelyanov, P. & Ponomaryov, D., 18 Oct 2017, Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017. Institute of Electrical and Electronics Engineers Inc., p. 55-60 6 p. 8071964. (Proceedings - 2017 Siberian Symposium on Data Science and Engineering, SSDSE 2017).

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

  6. Progression of decomposed local-effect action theories

    Ponomaryov, D. & Soutchanski, M., 1 Jun 2017, In: ACM Transactions on Computational Logic. 18, 2, 41 p., 16.

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

  7. On the complexity of semantic integration of OWL ontologies

    Kazakov, Y. & Ponomaryov, D., 1 Jan 2017, In: CEUR Workshop Proceedings. 1879

    Research output: Contribution to journal › Conference article › peer-review

Previous 1 2 Next

ID: 3449889