所有常度图Tseitin公式正则分辨率反驳的近最优下界

{"title":"所有常度图Tseitin公式正则分辨率反驳的近最优下界","authors":"D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov","doi":"10.1007/s00037-021-00213-2","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":51005,"journal":{"name":"Computational Complexity","volume":" ","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s00037-021-00213-2","citationCount":"0","resultStr":"{\"title\":\"Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs\",\"authors\":\"D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov\",\"doi\":\"10.1007/s00037-021-00213-2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":51005,\"journal\":{\"name\":\"Computational Complexity\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2021-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1007/s00037-021-00213-2\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational Complexity\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00037-021-00213-2\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational Complexity","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00037-021-00213-2","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}