Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
Crossref DOI link: https://doi.org/10.1007/s00037-021-00213-2
Published Online: 2021-08-27
Published Print: 2021-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Itsykson, Dmitry
Riazanov, Artur
Sagunov, Danil
Smirnov, Petr https://orcid.org/0000-0002-2246-0273
Text and Data Mining valid from 2021-08-27
Version of Record valid from 2021-08-27
Article History
Received: 24 December 2020
First Online: 27 August 2021
Change Date: 17 November 2021
Change Type: Correction
Change Details: A Correction to this paper has been published:
Change Details: https://doi.org/10.1007/s00037-021-00216-z