1. 2019
  2. 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 proceedingConference contributionResearchpeer-review

ID: 33858017