Correction to: ``Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs

DOI10.1007/s00037-021-00216-zOpenAlexW3211919789WikidataQ113906240 ScholiaQ113906240MaRDI QIDQ2062864

Artur Riazanov, Danil Sagunov, Petr Smirnov, Dmitry Itsykson

Publication date: 3 January 2022

Published in: Computational Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00037-021-00216-z

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

This page was built for publication: Correction to: ``Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs