1. 2005
  2. Computational complexity of problems related to DNA sequencing by hybridization

    Popov, V. Y., 2005, In: Doklady Mathematics. 72, 1, p. 642-644 3 p.

    Research output: Contribution to journalArticlepeer-review

  3. ВЫЧИСЛИТЕЛЬНАЯ СЛОЖНОСТЬ ПРОБЛЕМ, СВЯЗАННЫХ С РАСШИФРОВКОЙ ДНК ГИБРИДИЗАЦИЕЙ

    Попов, В. Ю., 2005, In: Доклады Академии наук. 403, 3, p. 316-318 3 p.

    Research output: Contribution to journalArticlepeer-review

  4. 2003
  5. The approximate period problem for DNA alphabet

    Popov, V. Y., 28 Jul 2003, In: Theoretical Computer Science. 304, 1-3, p. 443-447 5 p.

    Research output: Contribution to journalArticlepeer-review

  6. 2002
  7. On complexity of the word problem for finitely presented commutative semigroups

    Popov, V. Y., 2002, In: Siberian Mathematical Journal. 43, 6, p. 1086-1093 8 p.

    Research output: Contribution to journalArticlepeer-review

  8. On the finite base property for semigroup varieties

    Popov, V. Y., 2002, In: Siberian Mathematical Journal. 43, 5, p. 910-919 10 p.

    Research output: Contribution to journalArticlepeer-review

  9. 2001
  10. A ring variety without an independent basis

    Popov, V. Y., 2001, In: Mathematical Notes. 69, 5-6, p. 657-673 17 p.

    Research output: Contribution to journalArticlepeer-review

  11. 2000
  12. Undecidability of the word problem in relatively free rings

    Popov, V., 2000, In: Mathematical Notes. 67, 3-4, p. 495-504 10 p.

    Research output: Contribution to journalArticlepeer-review

  13. 1999
  14. On equational theories of varieties of anticommutative rings

    Popov, V., 1999, In: Mathematical Notes. 65, 1-2, p. 188-201 14 p.

    Research output: Contribution to journalArticlepeer-review

  15. 1998
  16. On the decidability of equational theories of varieties of rings

    Popov, V., 1998, In: Mathematical Notes. 63, 5-6, p. 770-776 7 p.

    Research output: Contribution to journalArticlepeer-review

Previous 1...8 9 10 11 12 Next

ID: 64529