Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational complexity 2021, Vol.30 (2), Article 16
Hauptverfasser:	Itsykson, Dmitry, Riazanov, Artur, Sagunov, Danil, Smirnov, Petr
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science Correction
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page
container_issue	2
container_start_page
container_title	Computational complexity
container_volume	30
creator	Itsykson, Dmitry Riazanov, Artur Sagunov, Danil Smirnov, Petr
description
doi_str_mv	10.1007/s00037-021-00216-z
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2598101267</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2598101267</sourcerecordid><originalsourceid>FETCH-LOGICAL-c159z-985c267eeb8a5106bd7fe2dcacbf53143126dc5ae40d7cf012cfa1fba8e3b0bb3</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhhdRsFb_gKeA5-gk2a96q9VWoVgo9Ryy2Undst3UZBex4H837QrevGSG8LzvwBNF1wxuGUB25wFAZBQ4oxCelO5PogGLOdB8lMSnYYfwKQTPz6ML7zcALMlFPIi-J9Y51G1lG9Lae_KKytHFrq22qiZz-4mOPNiuKT0JwBLXXa1cmN7W3TGzRNO16rAGwpCVx6qtGjK1bhtQT4x1ZFzXZBKAVjUtfcS1QyQzp3bv_jI6M6r2ePU7h9Hb9Gk1eabzxexlMp5TzZLRno7yRPM0QyxylTBIizIzyEutdGESwWLBeFrqRGEMZaYNMK6NYqZQOYoCikIMo5u-d-fsR4e-lRvbuSaclDwZ5UFOqA8U7yntrPcOjdy54MF9SQbyoFn2mmUwLI-a5T6ERB_yAW7W6P6q_0n9APNrgyg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2598101267</pqid></control><display><type>article</type><title>Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs</title><source>SpringerLink Journals - AutoHoldings</source><creator>Itsykson, Dmitry ; Riazanov, Artur ; Sagunov, Danil ; Smirnov, Petr</creator><creatorcontrib>Itsykson, Dmitry ; Riazanov, Artur ; Sagunov, Danil ; Smirnov, Petr</creatorcontrib><identifier>ISSN: 1016-3328</identifier><identifier>EISSN: 1420-8954</identifier><identifier>DOI: 10.1007/s00037-021-00216-z</identifier><language>eng</language><publisher>Cham: Springer International Publishing</publisher><subject>Algorithm Analysis and Problem Complexity ; Computational Mathematics and Numerical Analysis ; Computer Science ; Correction</subject><ispartof>Computational complexity, 2021, Vol.30 (2), Article 16</ispartof><rights>Springer Nature Switzerland AG 2021</rights><rights>Springer Nature Switzerland AG 2021.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-2246-0273</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00037-021-00216-z$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00037-021-00216-z$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Itsykson, Dmitry</creatorcontrib><creatorcontrib>Riazanov, Artur</creatorcontrib><creatorcontrib>Sagunov, Danil</creatorcontrib><creatorcontrib>Smirnov, Petr</creatorcontrib><title>Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs</title><title>Computational complexity</title><addtitle>comput. complex</addtitle><subject>Algorithm Analysis and Problem Complexity</subject><subject>Computational Mathematics and Numerical Analysis</subject><subject>Computer Science</subject><subject>Correction</subject><issn>1016-3328</issn><issn>1420-8954</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhhdRsFb_gKeA5-gk2a96q9VWoVgo9Ryy2Undst3UZBex4H837QrevGSG8LzvwBNF1wxuGUB25wFAZBQ4oxCelO5PogGLOdB8lMSnYYfwKQTPz6ML7zcALMlFPIi-J9Y51G1lG9Lae_KKytHFrq22qiZz-4mOPNiuKT0JwBLXXa1cmN7W3TGzRNO16rAGwpCVx6qtGjK1bhtQT4x1ZFzXZBKAVjUtfcS1QyQzp3bv_jI6M6r2ePU7h9Hb9Gk1eabzxexlMp5TzZLRno7yRPM0QyxylTBIizIzyEutdGESwWLBeFrqRGEMZaYNMK6NYqZQOYoCikIMo5u-d-fsR4e-lRvbuSaclDwZ5UFOqA8U7yntrPcOjdy54MF9SQbyoFn2mmUwLI-a5T6ERB_yAW7W6P6q_0n9APNrgyg</recordid><startdate>2021</startdate><enddate>2021</enddate><creator>Itsykson, Dmitry</creator><creator>Riazanov, Artur</creator><creator>Sagunov, Danil</creator><creator>Smirnov, Petr</creator><general>Springer International Publishing</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-2246-0273</orcidid></search><sort><creationdate>2021</creationdate><title>Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs</title><author>Itsykson, Dmitry ; Riazanov, Artur ; Sagunov, Danil ; Smirnov, Petr</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c159z-985c267eeb8a5106bd7fe2dcacbf53143126dc5ae40d7cf012cfa1fba8e3b0bb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithm Analysis and Problem Complexity</topic><topic>Computational Mathematics and Numerical Analysis</topic><topic>Computer Science</topic><topic>Correction</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Itsykson, Dmitry</creatorcontrib><creatorcontrib>Riazanov, Artur</creatorcontrib><creatorcontrib>Sagunov, Danil</creatorcontrib><creatorcontrib>Smirnov, Petr</creatorcontrib><collection>CrossRef</collection><jtitle>Computational complexity</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Itsykson, Dmitry</au><au>Riazanov, Artur</au><au>Sagunov, Danil</au><au>Smirnov, Petr</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs</atitle><jtitle>Computational complexity</jtitle><stitle>comput. complex</stitle><date>2021</date><risdate>2021</risdate><volume>30</volume><issue>2</issue><artnum>16</artnum><issn>1016-3328</issn><eissn>1420-8954</eissn><cop>Cham</cop><pub>Springer International Publishing</pub><doi>10.1007/s00037-021-00216-z</doi><orcidid>https://orcid.org/0000-0002-2246-0273</orcidid><oa>free_for_read</oa></addata></record>
fulltext	fulltext
identifier	ISSN: 1016-3328
ispartof	Computational complexity, 2021, Vol.30 (2), Article 16
issn	1016-3328 1420-8954
language	eng
recordid	cdi_proquest_journals_2598101267
source	SpringerLink Journals - AutoHoldings
subjects	Algorithm Analysis and Problem Complexity Computational Mathematics and Numerical Analysis Computer Science Correction
title	Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-03T10%3A08%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Correction%20to:%20Near-Optimal%20Lower%20Bounds%20on%20Regular%20Resolution%20Refutations%20of%20Tseitin%20Formulas%20for%20All%20Constant-Degree%20Graphs&rft.jtitle=Computational%20complexity&rft.au=Itsykson,%20Dmitry&rft.date=2021&rft.volume=30&rft.issue=2&rft.artnum=16&rft.issn=1016-3328&rft.eissn=1420-8954&rft_id=info:doi/10.1007/s00037-021-00216-z&rft_dat=%3Cproquest_cross%3E2598101267%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2598101267&rft_id=info:pmid/&rfr_iscdi=true