Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs

Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova. Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs. In Peter Rossmanith, Pinar Heggernes, Joost-Pieter Katoen, editors, 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany. Volume 138 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019. [doi]

Abstract

Abstract is missing.