1 - 10 out of 32Page size: 10
  1. 2021

  2. Computational and Proof Complexity of Partial String Avoidability

    Itsykson, D., Okhotin, A. & Oparin, V., Mar 2021, In: ACM Transactions on Computation Theory. 13, 1, 25 p., 3442365.

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

  3. 2020

  4. On obdd-based algorithms and proof systems that dynamically change the order of variables

    Itsykson, D., Knop, A., Romashchenko, A. & Sokolov, D., Jun 2020, In: Journal of Symbolic Logic. 85, 2, p. 632-670 39 p.

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

  5. Resolution over linear equations modulo two

    Itsykson, D. & Sokolov, D., Jan 2020, In: Annals of Pure and Applied Logic. 171, 1, 31 p., 102722.

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

  6. 2019

  7. Bounded-depth frege complexity of tseitin formulas for all graphs

    Galesi, N., Itsykson, D., Riazanov, A. & Sofronova, A., Aug 2019, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019. Katoen, J-P., Heggernes, P. & Rossmanith, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 138).

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

  8. On tseitin formulas, read-once branching programs and treewidth

    Glinskih, L. & Itsykson, D., 1 Jan 2019, Computer Science – Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Proceedings. van Bevern, R. & Kucherov, G. (eds.). Springer Nature, p. 143-155 13 p. (Lecture Notes in Computer Science; vol. 11532).

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

  9. 2018

  10. 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

  11. 2017

  12. Satisfiable tseitin formulas are hard for nondeterministic read-once branching programs

    Glinskih, L. & Itsykson, D., 1 Nov 2017, 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. Larsen, K. G., Raskin, J-F. & Bodlaender, H. L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 83).

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

  13. On OBDD-based algorithms and proof systems that dynamically change order of variables

    Itsykson, D., Knop, A., Romashchenko, A. & Sokolov, D., 1 Mar 2017, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. Vallee, B. & Vollmer, H. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 66).

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

  14. Hard satisfiable formulas for splittings by linear combinations

    Itsykson, D. & Knop, A., 1 Jan 2017, Theory and Applications of Satisfiability Testing – SAT 2017 - 20th International Conference, Proceedings. Gaspers, S. & Walsh, T. (eds.). Springer Nature, p. 53-61 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10491 LNCS).

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

  15. 2016

  16. Complexity of distributions and average-case hardness

    Itsykson, D., Knop, A. & Sokolov, D., 1 Dec 2016, 27th International Symposium on Algorithms and Computation, ISAAC 2016. Hong, S-H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 38.1-38.12 (Leibniz International Proceedings in Informatics, LIPIcs; vol. 64).

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

Previous 1 2 3 4 Next

ID: 35825084