pdf-format: |
|
@InProceedings{galesi_et_al:LIPIcs:2019:10993, author = {Nicola Galesi and Dmitry Itsykson and Artur Riazanov and Anastasia Sofronova}, title = {{Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs}}, booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-117-7}, ISSN = {1868-8969}, year = {2019}, volume = {138}, editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10993}, URN = {urn:nbn:de:0030-drops-109932}, doi = {10.4230/LIPIcs.MFCS.2019.49}, annote = {Keywords: Tseitin formula, treewidth, AC0-Frege} }
Keywords: | Tseitin formula, treewidth, AC0-Frege | |
Seminar: | 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) | |
Issue date: | 2019 | |
Date of publication: | 20.08.2019 |