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

  2. Reordering rule makes OBDD proof systems stronger

    Buss, S., Itsykson, D., Knop, A. & Sokolov, D., 1 Jun 2018, 33rd Computational Complexity Conference, CCC 2018. Servedio, R. A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 161-1624 1464 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 102).

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

  3. 2017

  4. Dag-like communication and its applications

    Sokolov, D., 1 Jan 2017, Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Proceedings. Weil, P. (ed.). Springer Nature, p. 294-307 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10304 LNCS).

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

Previous 1 2 Next

ID: 51174656