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

  2. Branching programs with bounded repetitions and flow formulas

    Sofronova, A. & Sokolov, D., 1 Jul 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 25 p. 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 200).

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

  3. The power of negative reasoning

    de Rezende, S. F., Lauria, M., Nordström, J. & Sokolov, D., 1 Jul 2021, 36th Computational Complexity Conference, CCC 2021. Kabanets, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 200).

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

  4. Automating algebraic proof systems is NP-hard

    De Rezende, S. F., Göös, M., Nordström, J., Pitassi, T., Robere, R. & Sokolov, D., 15 Jun 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, p. 209-222 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

  5. 2020

  6. Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

    de Rezende, S. F., Nordström, J., Risse, K. & Sokolov, D., 1 Jul 2020, 35th Computational Complexity Conference, CCC 2020. Saraf, S. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 28. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 169).

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

  7. (Semi)Algebraic proofs over {±1} variables

    Sokolov, D., 8 Jun 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 78-90 13 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

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

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

  10. Trade-offs between size and degree in polynomial calculus

    Lagarde, G., Nordström, J., Sokolov, D. & Swernofsky, J., Jan 2020, 11th Innovations in Theoretical Computer Science Conference, ITCS 2020. Vidick, T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 72. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 151).

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

  11. 2019

  12. Adventures in monotone complexity and TFNP

    Göös, M., Kamath, P., Robere, R. & Sokolov, D., 1 Jan 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 38. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

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

  13. 2018

  14. Monotone circuit lower bounds from resolution

    Garg, A., Kamath, P., Göös, M. & Sokolov, D., 20 Jun 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Henzinger, M., Kempe, D. & Diakonikolas, I. (eds.). Association for Computing Machinery, p. 801-814 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

Previous 1 2 Next

ID: 51174656