41 - 50 out of 54Page size: 10
  1. 2010

  2. On convex complexity measures

    Hrubeš, P., Jukna, S., Kulikov, A. & Pudlák, P., 28 Mar 2010, In: Theoretical Computer Science. 411, 16-18, p. 1842-1854 13 p.

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

  3. New upper bounds on the Boolean circuit complexity of symmetric functions

    Demenkov, E., Kojevnikov, A., Kulikov, A. & Yaroslavtsev, G., 1 Mar 2010, In: Information Processing Letters. 110, 7, p. 264-267 4 p.

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

  4. 2009

  5. Finding efficient circuits using SAT-solvers

    Kojevnikov, A., Kulikov, A. S. & Yaroslavtsev, G., 9 Nov 2009, Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. p. 32-44 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5584 LNCS).

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

  6. On covering graphs by complete bipartite subgraphs

    Jukna, S. & Kulikov, A. S., 28 May 2009, In: Discrete Mathematics. 309, 10, p. 3399-3403 5 p.

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

  7. New upper bounds for the problem of maximal satisfiability

    Kulikov, A. S. & Kutskov, K., 1 May 2009, In: Discrete Mathematics and Applications. 19, 2, p. 155-172 18 p.

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

  8. 2007

  9. New bounds for MAX-SAT by glause learning

    Kulikov, A. S. & Kutzkov, K., 24 Dec 2007, Computer Science - Theory and Applications - Second International Symposium on Computer Science in Russia, CSR 2007, Proceedings. p. 194-204 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4649 LNCS).

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

  10. 2006

  11. Automated proofs of upper bounds on the running time of splitting algorithms

    Fedin, S. S. & Kulikov, A. S., 1 May 2006, In: Journal of Mathematical Sciences . 134, 5, p. 2383-2391 9 p.

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

  12. A new approach to proving upper bounds for MAX-2-SAT

    Kojevnikov, A. & Kulikov, A. S., 28 Feb 2006, p. 11-17. 7 p.

    Research output: Contribution to conference › Paper › peer-review

  13. Complexity of semialgebraic proofs with restricted degree of falsity

    Kojevnikov, A. & Kulikov, A. S., 1 Jan 2006, Theory and Applications of Satisfiability Testing, SAT 2006 - 9th International Conference, Proceedings. Springer Nature, p. 11-21 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4121 LNCS).

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

  14. 2005

  15. On some problems of computational geometry: Isogeometric smoothing and geometric search

    Kulikov, A., 1 Dec 2005.

    Research output: Contribution to conference › Paper › peer-review

Previous 1 2 3 4 5 6 Next

ID: 9512817